108 search results - page 13 / 22 » Computing Approximate Nash Equilibria in Network Congestion ... |
WINE
2009
Springer
14 years 1 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
FOCS
2009
IEEE
14 years 1 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...
SIGECOM
2006
ACM
14 years 20 days ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
ISAAC
2005
Springer
14 years 7 days ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...