Hide and Seek Game with Multiple Resources
- 27 August 2018
- book chapter
- Published by Springer Nature
- p. 82-86
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games2018
- Faster and Simpler Algorithm for Optimal Strategies of Blotto GameProceedings of the AAAI Conference on Artificial Intelligence, 2017
- From Duels to Battlefields: Computing Equilibria of Blotto and Other GamesProceedings of the AAAI Conference on Artificial Intelligence, 2016
- Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and UniquenessJournal of Artificial Intelligence Research, 2011
- Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation GamesProceedings of the AAAI Conference on Artificial Intelligence, 2010
- Fatal Attraction: Salience, Naïveté, and Sophistication in Experimental “Hide-and-Seek” GamesAmerican Economic Review, 2007
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem1953
- The Theory of Play and Integral Equations with Skew Symmetric KernelsEconometrica, 1953