Commitment Games with Conditional Information Disclosure | Proceedings of the AAAI Conference on Artificial Intelligence
Login to access subscriber-only resources. Part of the PKP Publishing Services Network Copyright © 2024, Association for the Advancement of Artificial Intelligence
Commitment Games with Conditional Information Disclosure Authors Anthony DiGiovanni Center on Long-Term Risk Jesse Clifton Center on Long-Term Risk DOI: https://doi.org/10.1609/aaai.v37i5.25697 Keywords: GTEP: Game Theory, GTEP: Equilibrium Abstract The conditional commitment abilities of mutually transparent computer agents have been studied in previous work on commitment games and program equilibrium. This literature has shown how these abilities can help resolve Prisoner’s Dilemmas and other failures of cooperation in complete information settings. But inefficiencies due to private informat
related reading
- Folk theorem (game theory) - Wikipediaen.wikipedia.org
- Common Knowledge and Aumann’s Agreement Theoremscottaaronson.blog
- Game theory - Wikipediaen.wikipedia.org
- An annotated bibliography on program equilibriumandrew.cmu.edu
- Nash equilibrium - Wikipediaen.wikipedia.org
- Focal point (game theory) - Wikipediaen.wikipedia.org
- Superrationality - Wikipediaen.wikipedia.org
- Robust Cooperation in the Prisoner's Dilemma — LessWronglesswrong.com
- OsborneRubinsteinMasterpiece.pdfsites.math.rutgers.edu
- Sections 1 & 2: Introduction, Strategy and Governance — LessWronglesswrong.com
- Signaling gameen.wikipedia.org
- Towards a scale-free theory of intelligent agency — AI Alignment Forumalignmentforum.org