5995 search results - page 15 / 1199 » Algorithmic Game Theory |
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
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 prob...
164
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
SAGT
2009
Springer
15 years 4 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
84
Voted
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...