Sciweavers

1167 search results - page 14 / 234
» Relational Markov Games
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
14 years 9 months ago
Unbeatable Imitation
We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide nece...
Peter Duersch, Joerg Oechssler, Burkhard C. Schipp...
ECAI
2004
Springer
15 years 3 months ago
Game-Theoretic Agent Programming in Golog
We present the agent programming language GTGolog, which integrates explicit agent programming in Golog with gametheoretic multi-agent planning in Markov games. It is a generalizat...
Alberto Finzi, Thomas Lukasiewicz
CORR
2010
Springer
110views Education» more  CORR 2010»
14 years 9 months ago
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
LICS
2007
IEEE
15 years 3 months 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, ...
FOCS
2010
IEEE
14 years 7 months ago
Subexponential Algorithms for Unique Games and Related Problems
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
Sanjeev Arora, Boaz Barak, David Steurer