60 search results - page 3 / 12 » From Computing Sets of Optima, Pareto Sets, and Sets of Nash... |
SAGT
2009
Springer
14 years 2 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...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
JOTA
2011
13 years 2 months ago
2011
We propose the definition of T-KKM points and consider generic stability of T-KKM mappings and essential components of sets of T-KKM points. As applications, using a unified appr...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
UAI
2000
13 years 9 months ago
2000
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...