108 search results - page 9 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
TCS
2010
13 years 5 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
In this work, we study the problem of power allocation in teams. Each team consists of two agents who try to split their available power between the tasks of communication and jam...