Results 211 to 220 of about 2,305 (251)

Congestion games revisited [PDF]

open access: possibleInternational Journal of Game Theory, 2007
The author considers several classes of strategic games with special restrictions which may be imposed on utilities, participation rules, or strategies of players and investigate their relations with attaining a Nash equilibrium after a finite number of steps and with potential games.
openaire   +3 more sources

Graphical Congestion Games

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vittorio Bilò   +3 more
openaire   +10 more sources

A common generalization of budget games and congestion games

Journal of Combinatorial Optimization, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fuga Kiyosue, Kenjiro Takazawa
openaire   +3 more sources

Chaotic congestion games

Applied Mathematics and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad Kabir Naimzada   +1 more
openaire   +2 more sources

On Lookahead Equilibria in Congestion Games

Mathematical Structures in Computer Science, 2013
We investigate the issues of existence and efficiency of lookahead equilibria in congestion games. Lookahead equilibria, whose study has been initiated by Mirrokniet al.(2012), correspond to the natural extension of pure Nash equilibria in which the players, when making use of global information in order to predict subsequent reactions of the other ...
Vittorio Bilò   +2 more
openaire   +8 more sources

Welfare maximization in congestion games

Proceedings of the 7th ACM conference on Electronic commerce, 2006
Congestion games are non-cooperative games where the utility of a player from using a certain resource depends on the total number of players that are using the same resource. While most work so far took a distributed game-theoretic approach to this problem, this paper studies centralized solutions for congestion games.
Liad Blumrosen, Shahar Dobzinski
openaire   +3 more sources

Congestion Games with Agent Failures

Proceedings of the AAAI Conference on Artificial Intelligence, 2021
We propose a natural model for agent failures in congestion games. In our model, each of the agents may fail to participate in the game, introducing uncertainty regarding the set of active agents. We examine how such uncertainty may change the Nash equilibria (NE) of the game.
Reshef Meir   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy