Communication, Computability, and Common Interest Games
This paper provides a theory of equilibrium selection for one-shot two- player finite-action strategic-form common interest games. A single round of costless unlimited pre-play communication is allowed. Players are restricted to use strategies which are computable in the sense of Church's thesis. The equilibrium notion used involves perturbations which are themselves computable. The only equilibrium payoff vector which survives these strategic restrictions and the computable perturbations is the unique Pareto-efficient one.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- John C. Harsanyi & Reinhard Selten, 1988. "A General Theory of Equilibrium Selection in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262582384.
- Spear, Stephen E, 1989. "Learning Rational Expectations under Computability Constraints," Econometrica, Econometric Society, vol. 57(4), pages 889-910, July.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Anderlini, Luca & Sabourian, Hamid, 1995.
"Cooperation and Effective Computability,"
Econometric Society, vol. 63(6), pages 1337-1369, November.
- Anderlini, L. & Sabourian, H., 1991. "Cooperation and Effective Computability," Papers 167, Cambridge - Risk, Information & Quantity Signals.
- Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
- Canning, David, 1992. "Average behavior in learning models," Journal of Economic Theory, Elsevier, vol. 57(2), pages 442-472, August.
- Canning, D., 1990. "Average Behaviour In Learning Models," Papers 156, Cambridge - Risk, Information & Quantity Signals.
- D. Canning, 2010. "Average Behavior in Learning Models," Levine's Working Paper Archive 490, David K. Levine.
- Matsui, Akihiko, 1991. "Cheap-talk and cooperation in a society," Journal of Economic Theory, Elsevier, vol. 54(2), pages 245-258, August.
- Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(02), pages 179-214, October.
- Farrell, Joseph, 1988. "Communication, coordination and Nash equilibrium," Economics Letters, Elsevier, vol. 27(3), pages 209-214.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
- Sobel, Joel, 1993. "Evolutionary stability and efficiency," Economics Letters, Elsevier, vol. 42(2-3), pages 301-312.
- Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Warneryd Karl, 1993. "Cheap Talk, Coordination, and Evolutionary Stability," Games and Economic Behavior, Elsevier, vol. 5(4), pages 532-546, October.
- Kim, Yong-Gwan & Sobel, Joel, 1995. "An Evolutionary Approach to Pre-play Communication," Econometrica, Econometric Society, vol. 63(5), pages 1181-1193, September.
- Kim, Y.G. & Sobel, J., 1993. "An Evolutionary Approach to Pre-Play Communication," Working Papers 93-02, University of Iowa, Department of Economics.
- Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June. Full references (including those not matched with items on IDEAS)