Results 251 to 260 of about 621,141 (286)
Some of the next articles are maybe not open access.

Congestion games with malicious players

Proceedings of the 8th ACM conference on Electronic commerce, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moshe Babaioff   +2 more
openaire   +2 more sources

Fairness and optimality in congestion games

Proceedings of the 6th ACM conference on Electronic commerce, 2005
We 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   +1 more source

On Satisfiability Games and the Power of Congestion Games

2007
We 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   +2 more sources

The effect of collusion in congestion games

Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, 2006
In 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

2005
We 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

Heterogeneity and chaos in congestion games

Applied Mathematics and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naimzada, AK, Raimondo R
openaire   +1 more source

Congestion Management Games in Electricity Markets

Social Science Research Network
This paper proposes a game-theoretic model to analyze the strategic behavior of inc-dec gaming in market-based congestion management (redispatch). We extend existing models by considering incomplete information about competitors’ costs and a finite set ...
Karl-Martin Ehrhart   +6 more
semanticscholar   +1 more source

Coping with Selfishness in Congestion Games: Analysis and Design via LP Duality

Monographs in Theoretical Computer Science. An EATCS Series, 2023
V. Bilò, Cosimo Vinci
semanticscholar   +1 more source

The price of Anarchy in series-parallel network congestion games

Mathematical programming, 2022
Bainian Hao, Carla Michini
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy