BILO', VITTORIO
 Distribuzione geografica
Continente #
EU - Europa 3.860
NA - Nord America 1.363
AS - Asia 366
Continente sconosciuto - Info sul continente non disponibili 9
OC - Oceania 1
SA - Sud America 1
Totale 5.600
Nazione #
IT - Italia 1.512
IE - Irlanda 1.495
US - Stati Uniti d'America 1.359
SE - Svezia 365
UA - Ucraina 316
IN - India 125
SG - Singapore 119
FI - Finlandia 87
HK - Hong Kong 52
CN - Cina 33
DE - Germania 20
KR - Corea 17
BE - Belgio 16
FR - Francia 11
NL - Olanda 11
GB - Regno Unito 10
EU - Europa 9
RU - Federazione Russa 8
JP - Giappone 6
CA - Canada 3
IL - Israele 3
TR - Turchia 3
TW - Taiwan 3
AL - Albania 2
AT - Austria 2
AU - Australia 1
BD - Bangladesh 1
BG - Bulgaria 1
GR - Grecia 1
HR - Croazia 1
IR - Iran 1
KH - Cambogia 1
KZ - Kazakistan 1
LB - Libano 1
MD - Moldavia 1
PA - Panama 1
RS - Serbia 1
UY - Uruguay 1
Totale 5.600
Città #
Dublin 1.495
Lecce 1.436
Chandler 206
Jacksonville 198
Wayanad 116
Princeton 107
Singapore 75
Des Moines 64
Ann Arbor 39
Central District 37
Wilmington 37
Ogden 29
West Jordan 26
Boardman 23
Seoul 17
Brussels 16
Ashburn 15
Los Angeles 13
Hong Kong 12
Norwalk 12
Amsterdam 11
New York 10
Helsinki 9
Jinan 7
Las Vegas 7
Mumbai 7
Pescara 7
Lappeenranta 6
Lequile 5
Pisa 5
Tokyo 5
Altamura 4
Hebei 4
Houston 4
Rome 4
Beijing 3
Central 3
Edinburgh 3
Kocaeli 3
San Mateo 3
Santa Clara 3
Shenyang 3
Taipei 3
Woodbridge 3
Augusta 2
Bitonto 2
Cedar Knolls 2
Dallas 2
Frankfurt Am Main 2
Frankfurt am Main 2
Lanciano 2
Milan 2
Nanjing 2
Nuremberg 2
Palo Del Colle 2
Sesto San Giovanni 2
Shanghai 2
Taurisano 2
Tel Aviv 2
Tirana 2
Waltham Forest 2
Zhengzhou 2
Aradeo 1
Ardabil 1
Auburn Hills 1
Bangalore 1
Belgrade 1
Berlin 1
Bremen 1
Brindisi 1
Bussolengo 1
Casavatore 1
Changsha 1
Chicago 1
Chisinau 1
Copertino 1
Fisciano 1
Forest City 1
Glasgow 1
Guangzhou 1
Hangzhou 1
Hod Hasharon 1
Jiaxing 1
Leawood 1
London 1
Mannheim 1
Marseille 1
Mcallen 1
Meda 1
Monmouth Junction 1
Montevideo 1
Moscow 1
Mīrpur 1
Nanchang 1
New Delhi 1
Ningbo 1
Oral 1
Osaka 1
Panama City 1
Pasadena 1
Totale 4.169
Nome #
On the Sequential Price of Anarchy of Isolation Games 91
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 89
On colorful bin packing games 84
The price of anarchy of affine congestion games with similar strategies 78
null 77
New Bounds for the Balloon Popping Problem 75
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems 75
Sharing the Cost of Multicast Transmissions in Wireless Networks 71
Bounds on the Price of Stability of Undirected Network Design with Three Players 69
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions 68
Almost Envy-Free Allocations with Connected Bundles 68
Some Anomalies of Farsighted Strategic Behavior 67
Geometric clustering to minimize the sum of cluster sizes 67
Uniform mixed equilibria in network congestion games with link failures 67
A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games 66
null 66
Sharing the Cost of Multicast Transmissions in Wireless Networks 65
Approximating the revenue maximization problem with sharp demands 65
On the Performance of Mildly Greedy Players in Cut Games 65
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games 65
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 64
On the Price of Stability of Fractional Hedonic Games 64
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation 64
The Price of Envy-Freeness in Machine Scheduling 63
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 62
On the impact of buyers preselection in pricing problems 62
A Catalog of $ℝ-Complete Decision Problems about Nash Equilibria in Multi-Player Games 61
The Price of Anarchy in All-Optical Networks 61
Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria 60
The Price of Nash Equilibria in Multicast Transmissions Games 60
17th Italian Conference on Theoretical Computer Science 60
Complexity of Rational and Irrational Nash Equilibria 59
The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games 59
Some Anomalies of Farsighted Strategic Behavior 59
Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology 59
Congestion Games with Priority-Based Scheduling 59
On Satisfiability Games and the Power of Congestion Games 58
Pareto Approximations for the Bicriteria Scheduling Problem 58
Approximation the Revenue Maximization Problem with Sharp Demands 58
The price of stability of fair undirected broadcast games is constant 58
On the Crossing Spanning Tree Problem 57
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 57
Graphical Congestion Games 57
On Bidimensional Congestion Games 57
On the Packing of Selfish Items 57
∃ℝ-complete decision problems about symmetric nash equilibria in symmetric multi-player games 56
On the IP Routing Tables Minimization with Addresses Reassignments 55
Quality of Service in Wireless Networks 55
Proceedings of the 10th International Symposium on Algorithmic Game Theory 55
An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph 54
Pricing problems with buyer preselection 54
Pareto Approximations for the Bicriteria Scheduling Problem 53
When Ignorance Helps: Graphical Multicast Cost Sharing Games 53
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games 53
$exists ℝ$–Complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-Player Games 53
Computing Exact and Approximate Nash Equilibria in 2-Player Games 52
On the Performances of Nash Equilibria in Isolation Games 52
Nash Stability in Fractional Hedonic Games 51
Opinion Formation Games with Dynamic Social Influences 51
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games 50
On Lookahead Equilibria in Congestion Games 50
The Complexity of Rational and Irrational Nash Equilibria 50
Opinion Formation Games with Dynamic Social Influences 50
Almost envy-free allocations with connected bundles 50
General Opinion Formation Games with Social Group Membership 50
Dynamic taxes for polynomial congestion games 49
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games 48
The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant 48
Nash Social Welfare in Selfish and Online Load Balancing 48
On Nash Equilibria in Non-Cooperative All-Optical Networks 48
When Ignorance Helps: Graphical Multicast Cost Sharing Games 47
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem 47
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions 47
Social Context Congestion Games 47
The Price of Envy-Freeness in Machine Scheduling 47
Game-Theoretic Approaches to Optimization Problems in Communication Networks 46
Social Context Congestion Games 46
Performances of One-Round Walks in Linear Congestion Games 45
On the Sequential Price of Anarchy of Isolation Games 45
Graphical Congestion Games 44
On Linear Congestion Games with Altruistic Social Context 44
On lookahead equilibria in congestion games 44
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions 44
Extending the notion of rationality of selfish agents: Second Order Nash equilibria 43
null 43
null 43
Graphical Congestion Games with Linear Latencies 42
On the Performance of Mildly Greedy Players in Cut Games 42
Performance of One-Round Walks in Linear Congestion Games 41
Quality of Service in Wireless Networks 40
New Bounds for the Balloon Popping Problem 40
The price of anarchy of affine congestion games with similar strategies 40
The quality of content publishing in the digital era 40
The Price of Nash Equilibria in Multicast Transmission Games 39
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games 39
On the performances of Nash Equilibria in Isolation Games 36
Selected papers of ICTCS 2016 (The Italian Conference on Theoretical Computer Science (ICTCS) 36
On Stackelberg Strategies in Affine Congestion Games 34
On Multidimensional Congestion Games 33
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems 30
Totale 5.473
Categoria #
all - tutte 38.395
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 38.395


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020831 0 81 4 93 57 224 88 132 20 39 91 2
2020/2021819 92 2 89 96 26 100 7 102 7 175 22 101
2021/2022436 9 2 30 55 78 1 8 38 15 19 40 141
2022/20232.480 112 88 73 62 93 123 76 82 1.650 18 69 34
2023/2024711 53 50 65 38 48 16 27 24 70 175 84 61
2024/202559 46 13 0 0 0 0 0 0 0 0 0 0
Totale 5.922