Representations and solutions for game-theoretic problems

Koller, Daphne; Pfeffer, Avi

doi:10.1016/s0004-3702(97)00023-4

Cited by 110 publications

(70 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as was first pointed out by Koller and Pfeffer [9], the equilibria computed by the Koller-Megiddo-von Stengel procedure may in general be "non-sensible" in a similar sense as discussed above for matrix games. Alex Selby [14], computing a strategy for a variant of Hold'Em poker found similar problems.…”

Section: Discussionmentioning

confidence: 74%

Computing Proper Equilibria of Zero-Sum Games

Miltersen

Sørensen

2007

Computers and Games

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 74%

Computing Proper Equilibria of Zero-Sum Games

Miltersen

Sørensen

2007

Computers and Games

View full text Add to dashboard Cite

show abstract

“…However, taking randomness into account is much more challenging (cf. the work by Koller and Pfeffer [8]). …”

Section: Monte Carlo Simulationmentioning

confidence: 91%

A Skat Player Based on Monte-Carlo Simulation

Kupferschmid

Helmert

2007

Computers and Games

View full text Add to dashboard Cite

Abstract. We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the techniques developed for Bridge. Our Skatplaying program integrates well-known techniques such as move ordering with two new search enhancements. Quasi-symmetry reduction generalizes symmetry reductions, popularized by Ginsberg's Partition Search algorithm, to search states which are "almost equivalent". Adversarial heuristics generalize ideas from single-agent search algorithms like A * to two-player games, leading to guaranteed lower and upper bounds for the score of a game position. Combining these techniques with state-of-the-art tree search algorithms, our program determines the game-theoretical value of a typical Skat hand (with perfect information) in 10 milliseconds.

show abstract

“…The original motivating application was the design of automated game-playing programs, such as for chess; a sample of modern applications is reviewed by Koller and Pfeffer [78]. For example, automated agents -anything from a physical robot to an automated bidding strategy in an Internet auction -are often programmed to optimize some payoff function while participating in a competitive or cooperative environment (see e.g.…”

Section: Who Cares About Computing Equilibria?mentioning

confidence: 99%