DMCA
A theoretical examination of practical game playing: Lookahead search (2012)
| Venue: | In SAGT, M. Serna, Ed. Lecture Notes in Computer Science Series |
| Citations: | 3 - 1 self |
BibTeX
@INPROCEEDINGS{Mirrokni12atheoretical,
author = {Vahab Mirrokni and Nithum Thain and Adrian Vetta},
title = {A theoretical examination of practical game playing: Lookahead search},
booktitle = {In SAGT, M. Serna, Ed. Lecture Notes in Computer Science Series},
year = {2012},
pages = {251--262},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play using lookahead search, each agent predicts multiple levels of possible re-actions to her move (via the use of a search tree), and then chooses the play that optimizes her future payoff accounting for these re-actions. There are several choices of optimization function the agents can choose, where the most appropriate choice of function will depend on the specifics of the actual game- we illustrate this in our examples. Furthermore, the type of search tree chosen by computationally-constrained agent can vary. We focus on the case where agents can evaluate only a bounded number, k, of moves into the future. That is, we use depth k search trees and call this approach k-lookahead search. We apply our method in five well-known settings: industrial organization (Cournot’s model); AdWord auctions; congestion games; valid-utility games and basic-utility games; cost-sharing network design games. We consider two questions. First, what is
Keyphrases
lookahead search theoretical examination practical game playing search tree basic-utility game approach k-lookahead search strategy play possible re-actions optimization function adword auction cost-sharing network design game valid-utility game bounded number several choice practical importance appropriate choice multiple level theoretical performance examination industrial organization future payoff accounting well-known setting congestion game actual game wide variety computationally-constrained agent
