Sciweavers

1698 search results - page 41 / 340
» Growing Complex Games
Sort
View
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 1 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
JAIR
2011
214views more  JAIR 2011»
14 years 18 days 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...
FLAIRS
1998
14 years 11 months ago
Strategic Evaluation in Complex Domains
In somecomplexdomains,like the gameof Go,evaluating a position is not simple. In other games,like Chessfor example,material balancegives goodandfast to compute insight onthe value...
Tristan Cazenave
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 years 8 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
CORR
2011
Springer
206views Education» more  CORR 2011»
14 years 1 months ago
A Study of Language Usage Evolution in Open Source Software
: In December of 2010, the new game CityVille achieved 6 million daily active users in just 8 days. Clearly the success of CityVille owes something to the fun gameplay experience i...
Siim Karus, Harald Gall