Sciweavers

11 search results - page 1 / 3
» Fast algorithms for finding proper strategies in game trees
Sort
View
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 5 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 8 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
JACM
2007
160views more  JACM 2007»
13 years 4 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
JCP
2008
131views more  JCP 2008»
13 years 4 months ago
Multi-Index Cooperative Mixed Strategy for Service Selection Problem in Service-Oriented Architecture
Under the environment of Service-Oriented Architecture (SOA), service users have to decide how to choose the proper provider from the candidates to obtain optimal service level. Th...
Yimin Shen, Jing Zhang, Yushun Fan