Sciweavers

466 search results - page 20 / 94
» A Parallel General Game Player
Sort
View
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
13 years 11 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
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 8 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
HT
2003
ACM
14 years 24 days ago
Paper chase revisited: a real world game meets hypermedia
In this short paper, we present a location aware mobile game which lets users play a paper chase game on a mobile device. By using their physical movement and location in the real...
Susanne Boll, Jens Krösche, Christian Wegener
COCOON
2010
Springer
14 years 10 days ago
A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
Ricky Rosen
CHI
2011
ACM
12 years 11 months ago
Placing a value on aesthetics in online casual games
Game designers frequently invest in aesthetic improvements such as music, sound effects, and animations. However, their exact value for attracting and retaining players remains un...
Erik Andersen, Yun-En Liu, Rich Snider, Roy Szeto,...