Sciweavers

11 search results - page 1 / 3
» Abstraction for Solving Large Incomplete-Information Games
Sort
View
NIPS
2007
13 years 5 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...
CEC
2005
IEEE
13 years 5 months ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin
ATAL
2008
Springer
13 years 5 months ago
Self-interested database managers playing the view maintenance game
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...
Hala Mostafa, Victor R. Lesser, Gerome Miklau
GAMESEC
2010
128views Game Theory» more  GAMESEC 2010»
13 years 1 months ago
Tracking Games in Mobile Networks
Abstract. Users of mobile networks can change their identifiers in regions called mix zones in order to defeat the attempt of third parties to track their location. Mix zones must ...
Mathias Humbert, Mohammad Hossein Manshaei, Julien...
JACM
2007
160views more  JACM 2007»
13 years 3 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm