Learning to coordinate; a recursion theoretic perspective
From MaRDI portal
Publication:1969697
DOI10.1023/A:1005182121401zbMATH Open0943.03034OpenAlexW1495725620MaRDI QIDQ1969697FDOQ1969697
Authors: Franco Montagna, Daniel N. Osherson
Publication date: 5 September 2000
Published in: Synthese (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005182121401
Recommendations
- On learning to coordinate. Random bits help, insightful normal forms, and competency isomorphisms
- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
- On the nonconvergence of fictitious play in coordination games
- An adaptive learning model in coordination games
- Learning, Local Interaction, and Coordination
Computational learning theory (68Q32) Rationality and learning in game theory (91A26) Applications of computability and recursion theory (03D80)
Cited In (7)
- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
- On learning to coordinate. Random bits help, insightful normal forms, and competency isomorphisms
- Secretive interaction. Players and strategies
- Learning secrets interactively. Dynamic modeling in inductive inference
- Is knowledge curse or blessing in pure coordination problems?
- Dynamic Modeling in Inductive Inference
- Obituary: Franco Montagna (1948--2015)
This page was built for publication: Learning to coordinate; a recursion theoretic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969697)