COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS

DOI10.1142/S0219198905000399zbMATH Open1105.91002OpenAlexW1965227606MaRDI QIDQ5694440FDOQ5694440

Authors: Yosi Ben-Asher, Eitan Farchi 

Publication date: 30 September 2005

Published in: International Game Theory Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219198905000399

Recommendations

• COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
• Simple search methods for finding a Nash equilibrium
• Search games: a review
• Fast algorithms for finding randomized strategies in game trees
• Static search games played over graphs and general metric spaces

zbMATH Keywords

Nash equilibriummixed strategiessearch gamespure strategies

Mathematics Subject Classification ID

Search theory (90B40) Noncooperative games (91A10) 2-person games (91A05)

Cites Work

• Searching ordered structures
• Software is different
• Handbook of game theory with economic applications. Vol. 1

Cited In (2)

• A parallel search game
• COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS

This page was built for publication: COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5694440)