Compact Representations Of Search In Complex Domains
AbstractWe introduce a new zero-sum matrix game for modeling search in structured domains. In this game, one player tries to find a "bug" while the other tries to hide it. Both players exploit the structure of the "search" domain. Intuitively, this search game is a mathematical generalization of the well known binary search. The generalization is from searching over totally ordered sets to searching over more complex search domains such as trees, partial orders and general set systems. As there must be one row for every search strategy, and there are exponentially many ways to search even in very simple search domains, the game's matrix has exponential size ("space"). In this work we present two ways to reduce the space required to compute the Nash value (in pure strategies) of this game:• First we show that a Nash equilibrium in pure strategies can be computed by using a backward induction on the matrices of each "part" or sub structure of the search domain. This can significantly reduce the space required to represent the game.• Next, we show when general search domains can be represented as DAGs (Directed Acycliqe Graphs). As a result, the Nash equilibrium can be directly computed using the DAG. Consequently the space needed to compute the desired search strategy is reduced to O(n2) where n is the size of the search domain.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by World Scientific Publishing Co. Pte. Ltd. in its journal International Game Theory Review.
Volume (Year): 07 (2005)
Issue (Month): 01 ()
Contact details of provider:
Web page: http://www.worldscinet.com/igtr/igtr.shtml
Find related papers by JEL classification:
- B4 - Schools of Economic Thought and Methodology - - Economic Methodology
- C0 - Mathematical and Quantitative Methods - - General
- C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
- C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
- D5 - Microeconomics - - General Equilibrium and Disequilibrium
- D7 - Microeconomics - - Analysis of Collective Decision-Making
- M2 - Business Administration and Business Economics; Marketing; Accounting - - Business Economics
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim).
If references are entirely missing, you can add them using this form.