Sciweavers

58 search results - page 3 / 12
» Abstraction pathologies in extensive games
Sort
View
NIPS
2007
13 years 7 months ago
Regret Minimization in Games with Incomplete Information
Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has re...
Martin Zinkevich, Michael Johanson, Michael H. Bow...
LICS
2012
IEEE
11 years 8 months ago
The Winning Ways of Concurrent Games
Abstract—A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an ex...
Pierre Clairambault, Julian Gutierrez, Glynn Winsk...
CSL
2009
Springer
14 years 15 days ago
Decidable Extensions of Church's Problem
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
Alexander Rabinovich
TACS
1994
Springer
13 years 10 months ago
Full Abstraction for PCF
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
Samson Abramsky, Pasquale Malacaria, Radha Jagadee...
ICTAI
2009
IEEE
14 years 17 days ago
Translation of an Argumentation Framework into a CP-Boolean Game
Abstract—There already exist some links between argumentation and game theory. For instance, dynamic games can be used for simulating interactions between agents in an argumentat...
Elise Bonzon, Caroline Devred, Marie-Christine Lag...