Results 231 to 240 of about 621,141 (286)
Some of the next articles are maybe not open access.
On Lookahead Equilibria in Congestion Games
Mathematical Structures in Computer Science, 2013We 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 +6 more sources
Welfare maximization in congestion games
Proceedings of the 7th ACM conference on Electronic commerce, 2006Congestion 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 +1 more source
Congestion Games with Agent Failures
Proceedings of the AAAI Conference on Artificial Intelligence, 2021We 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 +1 more source
The Demand-Side Management and Control of Smart Grids Based on Weighted Network Congestion Games
IEEE Transactions on Automation Science and EngineeringBased on the semi-tensor product of matrices, this article considers the demand-side management and state-flipped control of smart grids. Firstly, the smart grids with single-layer and multi-layer power companies can be modelled by a potential game under
Jinhuan Wang, Min Liu, Han Wu
semanticscholar +1 more source
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 +3 more sources
arXiv.org
We examine the problem of efficiently learning coarse correlated equilibria (CCE) in polyhedral games, that is, normal-form games with an exponentially large number of actions per player and an underlying combinatorial structure.
A. Kontogiannis +4 more
semanticscholar +1 more source
We examine the problem of efficiently learning coarse correlated equilibria (CCE) in polyhedral games, that is, normal-form games with an exponentially large number of actions per player and an underlying combinatorial structure.
A. Kontogiannis +4 more
semanticscholar +1 more source
Information Signaling With Concurrent Monetary Incentives in Bayesian Congestion Games
IEEE transactions on intelligent transportation systems (Print)The uncertainty held by a system’s users can cause ineffective decision-making. Nowhere is this more apparent than in transportation networks, where drivers’ uncertainty over current road/traffic conditions can negatively alter their routing choices.
Bryce L. Ferguson +2 more
semanticscholar +1 more source
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
arXiv.orgWe introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an $\epsilon$-approximate Nash Equilibrium in a polynomial number of rounds with ...
L. Dadi +4 more
semanticscholar +1 more source
Human-in-the-Loop Learning for Dynamic Congestion Games
IEEE Transactions on Mobile ComputingToday mobile users learn and share their traffic observations via crowdsourcing platforms (e.g., Google Maps and Waze). Yet such platforms simply cater to selfish users’ myopic interests to recommend the shortest path, and do not encourage enough users ...
Hongbo Li, Lingjie Duan
semanticscholar +1 more source
Distributed Learning for Dynamic Congestion Games
International Symposium on Information TheoryToday mobile users learn and share their traffic observations via crowdsourcing platforms (e.g., Google Maps and Waze). Yet such platforms myopically recommend the currently shortest path to users, and selfish users are unwilling to travel to longer ...
Hongbo Li, Lingjie Duan
semanticscholar +1 more source