Sciweavers

134 search results - page 8 / 27
» On the Complexity of Computing Values of Restricted Games
Sort
View
WINE
2010
Springer
152views Economy» more  WINE 2010»
13 years 5 months ago
Collusion in VCG Path Procurement Auctions
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...
Yoram Bachrach, Peter Key, Morteza Zadimoghaddam
AAAI
2006
13 years 9 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
JAIR
2011
214views more  JAIR 2011»
12 years 10 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...
STACS
2004
Springer
14 years 1 months ago
Active Context-Free Games
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
Anca Muscholl, Thomas Schwentick, Luc Segoufin
ATAL
2010
Springer
13 years 8 months ago
Stackelberg vs. Nash in security games: 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 mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...