Results 81 to 90 of about 166,027,039 (183)
LP-Based Covering Games with Low Price of Anarchy [PDF]
, 2014 We design a new class of vertex and set cover games, where the price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs.
Végh, László A. +2 more
core +1 more source
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, 2005 We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ(√N), where N is the number of players. For all other cases of symmetric or asymmetric games and for both maximum and average social cost, the price of anarchy is 5/2.
George Christodoulou 0001 +1 more
openaire +3 more sources
Price of anarchy is maximized at the percolation threshold
Physical Review E, 2015 When many independent users try to route traffic through a network, the flow can easily become suboptimal as a consequence of congestion of the most efficient paths. The degree of this suboptimality is quantified by the so-called "price of anarchy" (POA), but so far there are no general rules for when to expect a large POA in a random network.
openaire +4 more sources
Stability vs. optimality in selfish ring routing [PDF]
We study the asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the maximum latency of source-destination node-pairs over links with linear ...
Hu, Xiaodong +3 more
core
Efficiency analysis of load balancing games with and without activation costs [PDF]
, 2011 In this paper, we study two models of resource allocation games: the classical load-balancing game and its new variant involving resource activation costs.
Gürel, Sinan +3 more
core +1 more source
Social Distancing Network Creation. [PDF]
Algorithmica, 2023 Friedrich T +3 more
europepmc +1 more source
The price of anarchy is independent of the network topology [PDF]
Journal of Computer and System Sciences, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Interplay between security providers, consumers, and attackers: a weighted congestion game approach [PDF]
Network users can choose among different security solutions to protect their data. Those solutions are offered by competing providers, with possibly different performance and price levels.
Patrick Maillé +2 more
core
Robust Price of Anarchy for Atomic Games with Altruistic Players [PDF]
, 2011 We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i's perceived cost is a convex combination of 1-\beta_i times his direct cost and \beta_i ...
Chen, Po-An +6 more
core +2 more sources
Price of Anarchy with Heterogeneous Latency Functions
CoRR, 2014 totally 25 ...
Sanjiv Kapoor, Junghwan Shin
openaire +2 more sources