55 search results - page 8 / 11 » Settling the Complexity of Computing Two-Player Nash Equilib... |
ESA
2009
Springer
14 years 5 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...
COCOON
2008
Springer
14 years 17 days 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...
SODA
2004
ACM
14 years 4 days ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
AAAI
2006
14 years 5 days ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
—In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency select...