374 search results - page 5 / 75 » Generalized Nash equilibrium problems |
122
click to vote
SOFSEM
2009
Springer
16 years 28 days ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
122
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
150
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
151
Voted
ICML
2000
IEEE
16 years 4 months ago
2000
IEEE
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
167
click to vote
JAIR
2011
14 years 7 months ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...