Sciweavers

63 search results - page 9 / 13
» The computational complexity of nash equilibria in concisely...
Sort
View
JAIR
2011
214views more  JAIR 2011»
14 years 9 months ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
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...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...
AAAI
2006
15 years 7 months ago
On Strictly Competitive Multi-Player Games
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
Felix Brandt, Felix A. Fischer, Yoav Shoham
CONCUR
2007
Springer
16 years 6 days ago
Strategy Logic
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
16 years 18 days ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu