3504 search results - page 21 / 701 » Computational Aspects of Equilibria |
SIGECOM
2010
ACM
13 years 8 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
SCW
2012
IEEE
12 years 4 months ago
2012
IEEE
We consider pure exchange economies with finitely many private goods involving the choice of a public project. We discuss core-equivalence results in the general framework of non...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
WDAG
2007
Springer
14 years 2 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...