Improving approximate pure nash equilibria in congestion games
V Ravindran Vijayalakshmi, A Skopalik - International Conference on Web …, 2020 - Springer
Congestion games constitute an important class of games to model resource allocation by
different users. As computing an exact 18 or even an approximate 34 pure Nash equilibrium …
different users. As computing an exact 18 or even an approximate 34 pure Nash equilibrium …
The online best reply algorithm for resource allocation problems
We study the performance of a best reply algorithm for online resource allocation problems
with a diseconomy of scale. In an online resource allocation problem, we are given a set of …
with a diseconomy of scale. In an online resource allocation problem, we are given a set of …
Improving approximate pure Nash equilibria in congestion games
A Skopalik, VR Vijayalakshmi - arXiv preprint arXiv:2007.15520, 2020 - arxiv.org
Congestion games constitute an important class of games to model resource allocation by
different users. As computing an exact or even an approximate pure Nash equilibrium is in …
different users. As computing an exact or even an approximate pure Nash equilibrium is in …
[图书][B] Strategic Mechanisms in Multi-Agent Coordination
R Chandan - 2022 - search.proquest.com
Strategic interactions in multi-agent systems can be conveniently modeled, manipulated and
characterized within the analytical framework provided by game theory and mechanism …
characterized within the analytical framework provided by game theory and mechanism …
The Unintended Consequences of Minimizing the Price of Anarchy in Congestion Games
This work focuses on the design of taxes in atomic congestion games, a commonly studied
model for competitive resource sharing. While most related studies focus on optimizing …
model for competitive resource sharing. While most related studies focus on optimizing …
Check for updates
MKDD Schmand, A Tönnis - Algorithmic Game Theory: 12th …, 2019 - books.google.com
We study the performance of a best reply algorithm for online resource allocation problems
with a diseconomy of scale. In an online resource allocation problem, we are given a set of …
with a diseconomy of scale. In an online resource allocation problem, we are given a set of …
[图书][B] Algorithm and mechanism design for congested networks
A Bjelde - 2018 - search.proquest.com
We are tackling the problem of reducing high congestion in networks from a mathematical
point of view. First, we consider resource allocation problems where a set of commodities …
point of view. First, we consider resource allocation problems where a set of commodities …