512 search results - page 1 / 103 » Reducibility among equilibrium problems |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete.
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
TSP
2010
12 years 11 months ago
2010
[1, 2] have shown for the dynamic spectrum allocation problem that a competitive market model (which sets a price for transmission power on each channel) leads to a greater social...
JCP
2008
13 years 4 months ago
2008
Under the environment of Service-Oriented Architecture (SOA), service users have to decide how to choose the proper provider from the candidates to obtain optimal service level. Th...