294 search results - page 36 / 59 » The complexity of computing a Nash equilibrium |
STOC
2002
ACM
15 years 10 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
ORL
2006
14 years 9 months ago
2006
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions--the Vickr...
WIOPT
2010
IEEE
14 years 7 months ago
2010
IEEE
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...