Sciweavers

207 search results - page 24 / 42
» A Temporal Proof System for General Game Playing
Sort
View
UAI
2004
15 years 7 months ago
Dynamical Systems Trees
We propose dynamical systems trees (DSTs) as a flexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynam...
Andrew Howard, Tony Jebara
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
ATAL
2006
Springer
15 years 9 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
SIGMOD
2008
ACM
154views Database» more  SIGMOD 2008»
16 years 6 months ago
SEMMO: a scalable engine for massively multiplayer online games
We propose to demonstrate SEMMO, a consistency server for MMOs. The key features of SEMMO are its novel distributed consistency protocol and system architecture. The distributed n...
Nitin Gupta 0003, Alan J. Demers, Johannes Gehrke
LICS
2007
IEEE
16 years 4 days ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...