MOSCARDELLI, Luca
 Distribuzione geografica
Continente #
NA - Nord America 1.873
EU - Europa 1.670
AS - Asia 777
Continente sconosciuto - Info sul continente non disponibili 4
AF - Africa 2
Totale 4.326
Nazione #
US - Stati Uniti d'America 1.866
UA - Ucraina 409
CN - Cina 402
IE - Irlanda 349
TR - Turchia 295
GB - Regno Unito 218
SE - Svezia 200
IT - Italia 165
FR - Francia 114
DE - Germania 90
FI - Finlandia 76
IN - India 59
BE - Belgio 12
GR - Grecia 11
RU - Federazione Russa 8
AT - Austria 7
CA - Canada 7
IL - Israele 6
JP - Giappone 5
EU - Europa 4
HK - Hong Kong 3
PL - Polonia 3
AL - Albania 2
BG - Bulgaria 2
TH - Thailandia 2
AE - Emirati Arabi Uniti 1
CH - Svizzera 1
CZ - Repubblica Ceca 1
EG - Egitto 1
IQ - Iraq 1
KH - Cambogia 1
LU - Lussemburgo 1
MO - Macao, regione amministrativa speciale della Cina 1
NO - Norvegia 1
SC - Seychelles 1
SG - Singapore 1
Totale 4.326
Città #
Jacksonville 448
Chandler 387
Dublin 348
Princeton 178
Southend 172
Izmir 164
Nanjing 115
Ashburn 90
Altamura 75
Cambridge 68
Wilmington 64
Ann Arbor 62
Beijing 61
Dearborn 51
Boardman 45
Nanchang 37
Woodbridge 33
Shenyang 27
Hebei 23
Tianjin 20
Kunming 19
Jiaxing 18
Los Angeles 16
Washington 14
Changsha 13
Chennai 13
Pescara 13
Andover 12
Norwalk 12
Hangzhou 10
Houston 10
Brussels 9
Auburn Hills 8
Chieti 8
Francavilla Al Mare 8
Helsinki 8
Jinan 8
Changchun 6
Grevenbroich 6
Ningbo 6
Toronto 6
Kocaeli 5
Lanzhou 5
Orange 5
Vienna 5
Hefei 4
Redwood City 4
Francavilla al Mare 3
Guangzhou 3
Leuven 3
Seattle 3
Zhengzhou 3
Bangkok 2
Haikou 2
Hanover 2
Martino 2
New York 2
Rome 2
Shanghai 2
Simi Valley 2
Sofia 2
Stanford 2
Tirana 2
Tokyo 2
Trumbull 2
Walnut 2
Warsaw 2
Agnone 1
Atlanta 1
Baotou 1
Basra 1
Brno 1
Cairo 1
Cantù 1
Central 1
Chengdu 1
Chongqing 1
Dallas 1
Dubai 1
Edinburgh 1
Fairfield 1
Florence 1
Frankfurt am Main 1
Fukuoka 1
Fuzhou 1
Guiyang 1
Holon 1
Isernia 1
Islington 1
Kherson 1
Kraków 1
Lexington 1
London 1
Luxembourg 1
Macao 1
Montesilvano Marina 1
Montreal 1
Mountain View 1
Naples 1
Omaha 1
Totale 2.797
Nome #
Graphical Congestion Games 84
Approximating the Traffic Grooming Problem with respect to ADMs and OADMs 78
Asymptotically Optimal Solutions for Small World Graphs 77
Brief Announcement: Graphical Congestion Games with Linear Latencies 76
Sharing the Cost of Multicast Transmission in Wireless Networks 75
Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation 75
Experimental Evaluation of Algorithms for IP Table Minimization 73
Performances of One-Round Walks in Linear Congestion Games 73
Approximating the Traffic Grooming Problem in Tree and Star Networks 72
Approximating the Traffic Grooming Problem in Tree and Star Networks 72
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 72
Stackelberg Strategies for Network Design Games 70
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks 70
Game Theoretical Issues in Optical Networks 68
Minimizing total busy time in parallel scheduling with application to optical networks 67
The Price of Anarchy in All-Optical Networks 67
Tight Bounds for Selfish and Greedy Load Balancing 67
null 66
Uniform mixed equilibria in network congestion games with link failures 65
The speed of Convergence in Congestion Games under Best Response Dynamics 64
Stable outcomes in modified fractional hedonic games 64
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 64
The speed of Convergence in Congestion Games under Best Response Dynamics 62
Interference Games in Wireless Networks. 61
On Nash Equilibria in Non-Cooperative All-Optical Networks 60
Pareto Approximations for the Bicriteria Scheduling Problem 60
When Ignorance helps: Graphical Cost Sharing Games 59
Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks 59
null 59
null 59
Approximating the Traffic Grooming Problem 58
Computing approximate nash equilibria in network congestion games with polynomially decreasing cost functions 58
The price of stability for undirected broadcast network design with fair cost allocation is constant 58
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem 57
When ignorance helps: Graphical multicast cost sharing games 57
Minimizing the number of ADMs with and without traffic grooming: complexity and approximability 56
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays 56
Opinion formation games with dynamic social influences 55
On lookahead equilibria in congestion games 55
Multicast Transmission in Non-Cooperative Networks with a Limited Number of Selfish Moves 55
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions 54
Optimizing regenerator cost in traffic grooming 54
Asymptotically Optimal Solutions for Small World Graphs 54
Tight Bounds for Selfish and Greedy Load Balancing 53
null 52
On the impact of buyers preselection in pricing problems 52
On best response dynamics in weighted congestion games with polynomial delays 51
Nash Stability in Fractional Hedonic Games 51
Opinion formation games with dynamic social influences 50
Pareto Approximations for the Bicriteria Scheduling Problem 48
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 48
The price of envy-freeness in machine scheduling 48
On the Convergence of Multicast Games in Directed Networks 47
Graphical Congestion Games 47
Pricing problems with buyer preselection 47
On the complexity of the regenerator placement problem in optical networks 47
Performances of One-Round Walks in Linear Congestion Games 46
Experimental Evaluation of Algorithms for IP Table Minimization 46
Convergence Issues in Congestion Games 46
Stackelberg Strategies for Network Design Games 45
Relaxed Core Stability in Fractional Hedonic Games 45
null 43
Hedonic games with social context 43
On the complexity of the regenerator placement problem in optical networks 43
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 42
The price of envy-freeness in machine scheduling 42
On the Convergence of Multicast Games in Directed Networks 42
On the Performances of Nash Equilibria in Isolation Games 41
Network Movement Games 40
Optimality and nash stability in additively separable generalized group activity selection problems 40
Local core stability in simple symmetric fractional hedonic games 38
The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation is Constant 37
Additively Separable Hedonic Games with Social Context 37
On lookahead equilibria in congestion games 36
On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare 35
Mobile Network Creation Games 34
Online coalition structure generation in graph games 33
On the Impact of Fair Best Response Dynamics 32
Stable outcomes in modified fractional hedonic games 32
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 32
On the sequential price of anarchy of isolation games 31
null 31
On the Sequential Price of Anarchy of Isolation Games 30
An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting problem 24
Approximating the Traffic Grooming Problem 23
Nash Social Welfare in Selfish and Online Load Balancing 23
The price of stability for undirected broadcast network design with fair cost allocation is constant 19
The traffic grooming problem in optical networks with respect to adms and oadms: Complexity and approximation 17
On nash equilibria in non-cooperative all-optical networks 14
Game-Theoretic Approaches to Optimization Problems in Communication Networks 14
Pricing Problems with Buyer Preselection 10
Nash Social Welfare in Selfish and Online Load Balancing (Short Paper) 8
Nash Social Welfare in Selfish and Online Load Balancing 8
Some Anomalies of Farsighted Strategic Behavior 7
Some Anomalies of Farsighted Strategic Behavior 7
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions 4
On the Online Coalition Structure Generation Problem 4
Hedonic Games with Fixed-Size Coalitions 3
Optimizing Regenerator Cost in Traffic Grooming (Extended Abstract) 2
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming 2
Totale 4.637
Categoria #
all - tutte 18.029
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 18.029


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019186 0 0 0 0 0 0 0 0 0 7 3 176
2019/2020897 319 68 0 38 44 48 142 85 22 33 89 9
2020/2021497 81 3 79 8 64 103 7 11 18 103 6 14
2021/2022371 7 3 37 47 31 8 4 25 36 14 59 100
2022/20231.230 123 128 33 133 152 237 88 78 184 8 49 17
2023/2024447 36 25 45 12 35 122 118 21 6 27 0 0
Totale 4.639