Results 241 to 250 of about 621,141 (286)

Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structure

ACM Trans. Economics and Comput.
We study the inefficiency of pure Nash equili bria in symmetric unweighted network congestion games. We first explore the impact of symmetry on the worst-case PoA of network congestion games.
Bainian Hao, Carla Michini
semanticscholar   +1 more source

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond

Adaptive Agents and Multi-Agent Systems
Congestion games offer a primary model of non-cooperative games, and a number of generalizations have been proposed, such as weighted congestion games, congestion games with mixed costs, and congestion games with complementarities.
Kenjiro Takazawa
semanticscholar   +1 more source

Learning Optimal Tax Design in Nonatomic Congestion Games

Neural Information Processing Systems
In multiplayer games, self-interested behavior among the players can harm the social welfare. Tax mechanisms are a common method to alleviate this issue and induce socially optimal behavior.
Qiwen Cui, Maryam Fazel, Simon S. Du
semanticscholar   +1 more source

When Altruism is Worse than Anarchy in Nonatomic Congestion Games

American Control Conference, 2021
We seek to understand the fundamental mathematics governing infrastructure-scale interactions between humans and machines, particularly when the machines' intended purpose is to influence and optimize the behavior of the humans.
Philip N. Brown
semanticscholar   +1 more source

Informational incentives for congestion games

2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017
We 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, Demosthenis Teneketzis   +1 more
openaire   +1 more source

Computing Nash Equilibria in Multidimensional Congestion Games

Adaptive Agents and Multi-Agent Systems
We study pure-strategy Nash equilibrium (PSNE) computation in k-dimensional congestion games (k-DCGs) where the weights or demands of the players are k-dimensional vectors.
Mohammad T. Irfan, Hau Chan, Jared Soundy   +2 more
semanticscholar   +1 more source

Strong Equilibrium in Congestion Games

Games and Economic Behavior, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Holzman, Ron, Law-Yone, Nissan
openaire   +1 more source

Bridging the Gap Between Central and Local Decision-Making: The Efficacy of Collaborative Equilibria in Altruistic Congestion Games

IEEE Conference on Decision and Control
Congestion games are popular models often used to study the system-level inefficiencies caused by selfish agents, typically measured by the price of anarchy.
Bryce L. Ferguson, Dario Paccagnan, Bary S. R. Pradelski, Jason R. Marden   +3 more
semanticscholar   +1 more source

Fair Artificial Currency Incentives in Repeated Weighted Congestion Games: Equity vs. Equality

IEEE Conference on Decision and Control
When users access shared resources in a selfish manner, the resulting societal cost and perceived users’ cost is often higher than what would result from a centrally coordinated optimal allocation.
Leonardo Pedroso, Andrea Agazzi, W. Heemels, Mauro Salazar   +3 more
semanticscholar   +1 more source

Transfer Implementation in Congestion Games

Dynamic Games and Applications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources