Results 151 to 160 of about 166,027,039 (183)
The Price of Anarchy of Cournot Oligopoly
, 2005 Cournot oligopoly is typically inefficient in maximizing social welfare which is total surplus of consumer and producer. This paper quantifies the inefficiency of Cournot oligopoly with the term “price of anarchy”, i.e. the worst-case ratio of the maximum possible social welfare to the social welfare at equilibrium.
Xiaolei Guo, Hai Yang 0003
openaire +4 more sources
Regret minimization and the price of total anarchy
Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008 We propose weakening the assumption made when studying the price of anarchy: Rather than assume that selfinterested players will play according to a Nash equilibrium (which may even be computationally hard to find), we assume only that selfish players play so as to minimize their own regret.
Avrim Blum +3 more
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Games and Economic Behavior, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nir Andelman +2 more
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nir Andelman +2 more
openaire +4 more sources
The Price of Anarchy of Strategic Queuing Systems
Journal of the ACM, 2023Bounding the price of anarchy, which quantifies the damage to social welfare due to selfish behavior of the participants, has been an important area of research in algorithmic game theory. Classical work on such bounds in repeated games makes the strong assumption that the subsequent rounds of the repeated games are independent beyond any influence on ...
Jason Gaitonde, Éva Tardos
openaire +2 more sources
Price of anarchy in parallel processing
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lingfei Yu +3 more
openaire +2 more sources
Local and global price of anarchy of graphical games [PDF]
Theoretical Computer Science, 2011 This paper initiates a study of connections between local and global properties of graphical games. Specifically, we introduce a concept of local price of anarchy that quantifies how well subsets of agents respond to their environments.
Amir Ronen +3 more
exaly +2 more sources
On the Sequential Price of Anarchy of Isolation Games
Journal of Combinatorial Optimization, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anna Angelucci +3 more
openaire +7 more sources
THE PRICE OF ANARCHY FOR RESTRICTED PARALLEL LINKS
Parallel Processing Letters, 2006In the model of restricted parallel links, n users must be routed on m parallel links under the restriction that the link for each user be chosen from a certain set of allowed links for the user. In a (pure) Nash equilibrium, no user may improve its own Individual Cost (latency) by unilaterally switching to another link from its set of allowed links ...
Gairing, M. +7 more
openaire +3 more sources
The price of anarchy in parallel queues revisited
ACM SIGMETRICS Performance Evaluation Review, 2010We consider a network of parallel, non-observable queues and analyze the Price of Anarchy (PoA) from the new point of view where the router has the memory of previous dispatching choices. In the regime where the demands grow with the network size, we provide an upper bound on the PoA by means of convex programming.
Anselmi, Jonatha, Gaujal, Bruno
openaire +2 more sources
Methodologies for Quantifying and Optimizing the Price of Anarchy
IEEE Transactions on Automatic ControlzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rahul Chandan +2 more
openaire +1 more source