Results 221 to 230 of about 2,305 (251)
Some of the next articles are maybe not open access.
On Bidimensional Congestion Games
2012We introduce multidimensional congestion games, that is, congestion games whose set of players can be partitioned into k+1 clusters C0,C1,…,Ck. Players in C0 have full information about all the other participants in the game, while players in Ci, for any 1≤i≤k, have full information only about the members of C0∪Ci and are unaware of all the other ones.
Vittorio Bilò +2 more
openaire +4 more sources
Strong Equilibrium in Congestion Games
Games and Economic Behavior, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Holzman, Ron, Law-Yone, Nissan
openaire +1 more source
Congestion games with malicious players
Proceedings of the 8th ACM conference on Electronic commerce, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moshe Babaioff +2 more
openaire +4 more sources
Informational incentives for congestion games
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017We investigate the problems of designing public and private information disclosure mechanisms by a principal in a transportation network so as to improve the overall congestion. We show that perfect disclosure of information about the routes' conditions is not optimal. The principal can improve the congestion (i.e.
Hamidreza Tavafoghi +1 more
openaire +1 more source
Transfer Implementation in Congestion Games
Dynamic Games and Applications, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Satisfiability Games and the Power of Congestion Games
2007We introduce and study satisfiability games, a new class of games that can be seen as the non-cooperative version of classical maximum satisfiability problems. We give several results involving these games and mainly focus on their expressiveness.
openaire +3 more sources
Heterogeneity and chaos in congestion games
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naimzada, AK, Raimondo R
openaire +1 more source
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, 2006In this paper we initiate the study of how collusion alters the quality of solutions obtained in competitive games. The price of anarchy aims to measure the cost of the lack of coordination by comparing the quality of a Nash equilibrium to that of a centrally designed optimal solution.
Ara Hayrapetyan, Éva Tardos, Tom Wexler
openaire +1 more source
On the Inefficiency of Equilibria in Congestion Games
2005We present a short geometric proof for the price of anarchy results that have recently been established in a series of papers on selfish routing in multicommodity flow networks. This novel proof also facilitates two new types of results: On the one hand, we give pseudo-approximation results that depend on the class of allowable cost functions.
José R. Correa +2 more
openaire +1 more source
Fairness and optimality in congestion games
Proceedings of the 6th ACM conference on Electronic commerce, 2005We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general problem is hard to approximate to any factor, we give simple algorithms for natural simplifications. We also consider these problems in the symmetric network congestion game model [
Deeparnab Chakrabarty +2 more
openaire +2 more sources