Sciweavers

3274 search results - page 93 / 655
» Communication strategies in games
Sort
View
LICS
2002
IEEE
14 years 3 months ago
Polarized Games
We study the comparison of dynamic semantics (games, dealing with interactions) with static semantics (dealing with results of interactions), in the spirit of Timeless Games [2]. ...
Olivier Laurent
MST
2010
98views more  MST 2010»
13 years 8 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
CORR
2011
Springer
164views Education» more  CORR 2011»
13 years 1 months ago
Lipschitz Games
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...
Yaron Azrieli, Eran Shmaya
SIGCSE
1998
ACM
115views Education» more  SIGCSE 1998»
14 years 2 months ago
Chance-It: an object-oriented capstone project for CS-1
Most people enjoy playing games. Most CS-1 students will enjoy a final project that involves computational game-playing. Chance-It is a simple two-person dice game with many possi...
Joel C. Adams
STACS
2004
Springer
14 years 3 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