Advanced Search
MyIDEAS: Login

Communication, Computability And Common Interest Games

Contents:

Author Info

  • ANDERLINI, L.

Abstract

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.)

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Paper provided by Cambridge - Risk, Information & Quantity Signals in its series Papers with number 159.

as in new window
Length: 37 pages
Date of creation: 1990
Date of revision:
Handle: RePEc:fth:cambri:159

Contact details of provider:
Postal: UNIVERSITY OF CAMBRIDGE, RESEARCH PROJECT ON RISK, INFORMATION AND QUANTITY SIGNALS IN ECONOMICS(E.S.R.C.), DEPARTMENT OF APPLIED ECONOMICS, SIDGWICK AV. CAMBRIDGE CB3 9DEDE U.K..
Email:
Web page: http://www.econ.cam.ac.uk/
More information through EDIRC

Related research

Keywords: communication ; game theory ; computers;

Other versions of this item:

Find related papers by JEL classification:

References

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.:
as in new window
  1. 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, December.
  2. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
  3. Anderlini, Luca & Sabourian, Hamid, 1995. "Cooperation and Effective Computability," Econometrica, Econometric Society, vol. 63(6), pages 1337-69, November.
  4. Kim, Y.G. & Sobel, J., 1993. "An Evolutionary Approach to Pre-Play Communication," Working Papers 93-02, University of Iowa, Department of Economics.
  5. Matsui, Akihiko, 1991. "Cheap-talk and cooperation in a society," Journal of Economic Theory, Elsevier, vol. 54(2), pages 245-258, August.
  6. Warneryd Karl, 1993. "Cheap Talk, Coordination, and Evolutionary Stability," Games and Economic Behavior, Elsevier, vol. 5(4), pages 532-546, October.
  7. Canning, David, 1992. "Average behavior in learning models," Journal of Economic Theory, Elsevier, vol. 57(2), pages 442-472, August.
  8. Sobel, Joel, 1993. "Evolutionary stability and efficiency," Economics Letters, Elsevier, vol. 42(2-3), pages 301-312.
  9. Farrell, Joseph, 1988. "Communication, coordination and Nash equilibrium," Economics Letters, Elsevier, vol. 27(3), pages 209-214.
  10. Binmore, Ken, 1987. "Modeling Rational Players: Part I," Economics and Philosophy, Cambridge University Press, vol. 3(02), pages 179-214, October.
  11. Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
  12. Spear, Stephen E, 1989. "Learning Rational Expectations under Computability Constraints," Econometrica, Econometric Society, vol. 57(4), pages 889-910, July.
  13. Megiddo, Nimrod, 1989. "On computable beliefs of rational machines," Games and Economic Behavior, Elsevier, vol. 1(2), pages 144-169, June.
  14. Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
  15. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Karl WÄrneryd, 1998. "Communication, complexity, and evolutionary stability," International Journal of Game Theory, Springer, vol. 27(4), pages 599-609.
  2. Dai, Darong, 2012. "On the existence and stability of Pareto optimal endogenous matching with fairness," MPRA Paper 40457, University Library of Munich, Germany.
  3. Carlsson, Hans & van Damme, Eric, 1993. "Global Games and Equilibrium Selection," Econometrica, Econometric Society, vol. 61(5), pages 989-1018, September.
  4. Damme, E.E.C. van, 1991. "Equilibrium selection in 2 x 2 games (Paper presented at the XV Simposio de Anàlisis Económico, Barcelona, 17-19 December, 1990)," Discussion Paper 1991-8, Tilburg University, Center for Economic Research.
  5. Tore Ellingsen & Robert �stling, 2010. "When Does Communication Improve Coordination?," American Economic Review, American Economic Association, vol. 100(4), pages 1695-1724, September.
  6. Gerber, Anke & Hens, Thorsten & Vogt, Bodo, 2010. "Rational investor sentiment in a repeated stochastic game with imperfect monitoring," Journal of Economic Behavior & Organization, Elsevier, vol. 76(3), pages 669-704, December.
  7. Luca Anderlini & Hamid Sabourian, . ""Cooperation and Computability in N-Player Games''," CARESS Working Papres 97-15, University of Pennsylvania Center for Analytic Research and Economics in the Social Sciences.
  8. Battalio,R. & Samuelson,L. & Huyck,J. van, 1998. "Risk dominance, payoff dominance and probabilistic choice learning," Working papers 2, Wisconsin Madison - Social Systems.
  9. Dimitri Dubois & Marc Willinger & Phu Nguyen-Van, 2009. "Optimization incentive and relative riskiness in experimental coordination games," Working Papers 02, Development and Policies Research Center (DEPOCEN), Vietnam.
  10. Giovanni Rossi, 2009. "Measuring conflict and power in strategic settings," Operations Research and Decisions, Wroclaw University of Technology, Institute of Organization and Management, vol. 2, pages 75-104.
  11. Andrew Colman & Michael Bacharach, 1997. "Payoff Dominance And The Stackelberg Heuristic," Theory and Decision, Springer, vol. 43(1), pages 1-19, July.
  12. K. Binmore & L. Samuelson, 2010. "Evolutionary Stability in Repeated Games Played by Finite Automata," Levine's Working Paper Archive 561, David K. Levine.
  13. D. Dubois & M. Willinger & P. Van Nguyen, 2012. "Optimization incentive and relative riskiness in experimental stag-hunt games," International Journal of Game Theory, Springer, vol. 41(2), pages 369-380, May.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:fth:cambri:159. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.