Extensive Infinite Games and Escalation, an exercise in Agda
Pierre Lescanne (LIP)
TL;DR
This paper uses formal proofs in Agda to demonstrate that escalation in infinite resource games is rational when agents assume resources are unlimited.
Contribution
It introduces a formal proof framework in Agda showing escalation as rational in infinite resource scenarios.
Findings
Escalation is rational under infinite resource assumptions.
Formal proofs in Agda support the rationality of escalation.
The approach clarifies conditions for escalation in infinite games.
Abstract
Escalation in games is when agents keep playing forever. Based on formal proofs we claim that if agents assume that resource are infinite, escalation is rational.
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
TopicsLogic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms · Advanced Algebra and Logic