A Defense Model for Games with Incomplete Information
Jamroga, Wojciech (2001) A Defense Model for Games with Incomplete Information. In: Joint German/Austrian Conference on AI, KI 2001, September 19-21, 2001, Vienna, Austria (pp. pp. 260-273).
Restricted to UT campus only : Request a copy
|Abstract:||Making a decision, an agent must consider how his outcome can be influenced by possible actions of other agents. A 'best defense model' for games involving uncertainty assumes usually that the opponents know everything about the actual situation and the player's plans for certain. In this paper it's argued that the assumption results in algorithms that are too cautious to be good in many game settings. Instead, a 'reasonably good defense' model is proposed: the player should look for a best strategy against all the potential actions of the opponents, still assuming that any opponent plays his best according to his actual knowledge. The defense model is formalized for the case of two-player zero-sum (adversary) games. Also, algorithms for decision-making against 'reasonably good defense' are proposed.
The argument and the ideas are supported by the results of experiments with random zero-sum two-player games on binary trees.
|Item Type:||Conference or Workshop Item|
|Copyright:||© 2001 Springer|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/63340|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page
Metis ID: 205753