TL;DR
This paper introduces a new concept of 'mistake' strategies in game theory, analyzes their relation to existing solution concepts, develops algorithms for their computation, and discusses potential practical applications such as detecting cheating in online games.
Contribution
It defines 'mistake' strategies, explores their theoretical properties, and proposes algorithms for their computation, with applications in cybersecurity and game integrity.
Findings
Defined 'mistake' strategies and actions in game theory.
Analyzed the relationship to existing solution concepts.
Explored algorithms for computing mistake strategies.
Abstract
We define a new concept of "mistake" strategies and actions for strategic-form and extensive-form games, analyze the relationship to prior main game-theoretic solution concepts, study algorithms for computation, and explore practicality. This concept has potential applications to cybersecurity, for example detecting whether a human player is illegally using real-time assistance in games like poker.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Game Theory and Applications · Computability, Logic, AI Algorithms