On bandwidth-limited sum-of-games problems

C. Dingankar, Sampada Karandikar, R. Brooks, Christopher Griffin

Research output: Contribution to journalArticle

Abstract

Game theory typically considers two types of imperfect information when analyzing conflicts: 1) chance moves and 2) information sets. This correspondence paper considers games where players compete on many fronts without having sufficient bandwidth to collect the game trees describing all the conflicts. The player therefore needs to prioritize between subgames without having detailed information about the subgames. We address this problem by using two combinatorial game theory tools: 1) surreal numbers and 2) thermographs. We consider the global conflict as a sum-of-games problem, which is known to be intractable (PSPACE complete). Known combinatorial game theory heuristics can analyze surreal-number encodings of games using thermographs to find solutions that are within a known constant offset of the optimal solution. To apply the combinatorial game theory to this domain, we first integrate chance moves into surreal-number encodings of games by showing that the expected values of surreal numbers are surreal numbers. We then show that, of the three commonly used sum-of-games heuristics, only hotstrat is applicable to this domain. Simulations compare solutions found using hotstrat to solution approaches used by other researchers on a similar problem (maximin, maximax, and mean). The simulations show that the hotstrat solutions dominate the existing approaches.

Original languageEnglish (US)
Article number5585787
Pages (from-to)341-349
Number of pages9
JournalIEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume41
Issue number2
DOIs
StatePublished - Mar 1 2011

Fingerprint

Game theory
Bandwidth

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Dingankar, C. ; Karandikar, Sampada ; Brooks, R. ; Griffin, Christopher. / On bandwidth-limited sum-of-games problems. In: IEEE Transactions on Systems, Man, and Cybernetics: Systems. 2011 ; Vol. 41, No. 2. pp. 341-349.
@article{697d2de3044e45f7b118240a487d6723,
title = "On bandwidth-limited sum-of-games problems",
abstract = "Game theory typically considers two types of imperfect information when analyzing conflicts: 1) chance moves and 2) information sets. This correspondence paper considers games where players compete on many fronts without having sufficient bandwidth to collect the game trees describing all the conflicts. The player therefore needs to prioritize between subgames without having detailed information about the subgames. We address this problem by using two combinatorial game theory tools: 1) surreal numbers and 2) thermographs. We consider the global conflict as a sum-of-games problem, which is known to be intractable (PSPACE complete). Known combinatorial game theory heuristics can analyze surreal-number encodings of games using thermographs to find solutions that are within a known constant offset of the optimal solution. To apply the combinatorial game theory to this domain, we first integrate chance moves into surreal-number encodings of games by showing that the expected values of surreal numbers are surreal numbers. We then show that, of the three commonly used sum-of-games heuristics, only hotstrat is applicable to this domain. Simulations compare solutions found using hotstrat to solution approaches used by other researchers on a similar problem (maximin, maximax, and mean). The simulations show that the hotstrat solutions dominate the existing approaches.",
author = "C. Dingankar and Sampada Karandikar and R. Brooks and Christopher Griffin",
year = "2011",
month = "3",
day = "1",
doi = "10.1109/TSMCA.2010.2064302",
language = "English (US)",
volume = "41",
pages = "341--349",
journal = "IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans",
issn = "1083-4427",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

On bandwidth-limited sum-of-games problems. / Dingankar, C.; Karandikar, Sampada; Brooks, R.; Griffin, Christopher.

In: IEEE Transactions on Systems, Man, and Cybernetics: Systems, Vol. 41, No. 2, 5585787, 01.03.2011, p. 341-349.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On bandwidth-limited sum-of-games problems

AU - Dingankar, C.

AU - Karandikar, Sampada

AU - Brooks, R.

AU - Griffin, Christopher

PY - 2011/3/1

Y1 - 2011/3/1

N2 - Game theory typically considers two types of imperfect information when analyzing conflicts: 1) chance moves and 2) information sets. This correspondence paper considers games where players compete on many fronts without having sufficient bandwidth to collect the game trees describing all the conflicts. The player therefore needs to prioritize between subgames without having detailed information about the subgames. We address this problem by using two combinatorial game theory tools: 1) surreal numbers and 2) thermographs. We consider the global conflict as a sum-of-games problem, which is known to be intractable (PSPACE complete). Known combinatorial game theory heuristics can analyze surreal-number encodings of games using thermographs to find solutions that are within a known constant offset of the optimal solution. To apply the combinatorial game theory to this domain, we first integrate chance moves into surreal-number encodings of games by showing that the expected values of surreal numbers are surreal numbers. We then show that, of the three commonly used sum-of-games heuristics, only hotstrat is applicable to this domain. Simulations compare solutions found using hotstrat to solution approaches used by other researchers on a similar problem (maximin, maximax, and mean). The simulations show that the hotstrat solutions dominate the existing approaches.

AB - Game theory typically considers two types of imperfect information when analyzing conflicts: 1) chance moves and 2) information sets. This correspondence paper considers games where players compete on many fronts without having sufficient bandwidth to collect the game trees describing all the conflicts. The player therefore needs to prioritize between subgames without having detailed information about the subgames. We address this problem by using two combinatorial game theory tools: 1) surreal numbers and 2) thermographs. We consider the global conflict as a sum-of-games problem, which is known to be intractable (PSPACE complete). Known combinatorial game theory heuristics can analyze surreal-number encodings of games using thermographs to find solutions that are within a known constant offset of the optimal solution. To apply the combinatorial game theory to this domain, we first integrate chance moves into surreal-number encodings of games by showing that the expected values of surreal numbers are surreal numbers. We then show that, of the three commonly used sum-of-games heuristics, only hotstrat is applicable to this domain. Simulations compare solutions found using hotstrat to solution approaches used by other researchers on a similar problem (maximin, maximax, and mean). The simulations show that the hotstrat solutions dominate the existing approaches.

UR - http://www.scopus.com/inward/record.url?scp=85028276713&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028276713&partnerID=8YFLogxK

U2 - 10.1109/TSMCA.2010.2064302

DO - 10.1109/TSMCA.2010.2064302

M3 - Article

AN - SCOPUS:85028276713

VL - 41

SP - 341

EP - 349

JO - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

JF - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

SN - 1083-4427

IS - 2

M1 - 5585787

ER -