IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

Communication, consensus and order. Who wants to speak first ?

  • Nicolas Houy

    (COE - Institute of Economic Research)

  • Lucie Ménager

    ()

    (EUREQUA - Equipe Universitaire de Recherche en Economie Quantitative - UP1 - Université Panthéon-Sorbonne - CNRS)

Parikh and Krasucki [1990] showed that if rational agents communicate the value of a function f according to a protocol upon which they have agreed beforehand, they will eventually reach a consensus about the value of f, provided a fairness condition on the protocol and a convexity condition on the function f. In this article, we address the issue of how agents agree on a communication protocol in the case where they communicate in order to learn information. We show that if it is common knowledge among a group of agents that some of them disagree about two protocols, then the consensus value of f must be the same according to the two protocols.

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.

File URL: https://halshs.archives-ouvertes.fr/halshs-00194365/document
Download Restriction: no

Paper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number halshs-00194365.

as
in new window

Length:
Date of creation: Feb 2005
Date of revision:
Handle: RePEc:hal:cesptp:halshs-00194365
Note: View the original document on HAL open archive server: https://halshs.archives-ouvertes.fr/halshs-00194365
Contact details of provider: Web page: https://hal.archives-ouvertes.fr/

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. Cave, Jonathan A. K., 1983. "Learning to agree," Economics Letters, Elsevier, vol. 12(2), pages 147-152.
  2. Marco Ottaviani & Peter Norman Sorensen, 2002. "Professional Advice: The Theory of Reputational Cheap Talk," Discussion Papers 02-05, University of Copenhagen. Department of Economics.
  3. Bacharach, Michael, 1985. "Some extensions of a claim of Aumann in an axiomatic model of knowledge," Journal of Economic Theory, Elsevier, vol. 37(1), pages 167-190, October.
  4. Timothy Feddersen & Wolfgang Pesendorfer, 1997. "Voting Behavior and Information Aggregation in Elections with Private Information," Econometrica, Econometric Society, vol. 65(5), pages 1029-1058, September.
  5. Krasucki, Paul, 1996. "Protocols Forcing Consensus," Journal of Economic Theory, Elsevier, vol. 70(1), pages 266-272, July.
  6. Scharfstein, David. & Stein, Jeremy C., 1988. "Herd behavior and investment," Working papers WP 2062-88., Massachusetts Institute of Technology (MIT), Sloan School of Management.
  7. John Geanakoplos & Heracles M. Polemarchakis, 1982. "We Can't Disagree Forever," Cowles Foundation Discussion Papers 639, Cowles Foundation for Research in Economics, Yale University.
  8. Crawford, Vincent P & Sobel, Joel, 1982. "Strategic Information Transmission," Econometrica, Econometric Society, vol. 50(6), pages 1431-51, November.
  9. Chamley, Christophe & Gale, Douglas, 1994. "Information Revelation and Strategic Delay in a Model of Investment," Econometrica, Econometric Society, vol. 62(5), pages 1065-85, September.
  10. Robert J Aumann, 1999. "Agreeing to Disagree," Levine's Working Paper Archive 512, David K. Levine.
  11. Sushil Bikhchandani & David Hirshleifer & Ivo Welch, 1998. "Learning from the Behavior of Others: Conformity, Fads, and Informational Cascades," Journal of Economic Perspectives, American Economic Association, vol. 12(3), pages 151-170, Summer.
  12. Ottaviani, Marco & Sorensen, Peter, 2001. "Information aggregation in debate: who should speak first?," Journal of Public Economics, Elsevier, vol. 81(3), pages 393-421, September.
  13. Parikh, Rohit & Krasucki, Paul, 1990. "Communication, consensus, and knowledge," Journal of Economic Theory, Elsevier, vol. 52(1), pages 178-189, October.
  14. Gul, Faruk & Lundholm, Russell, 1995. "Endogenous Timing and the Clustering of Agents' Decisions," Journal of Political Economy, University of Chicago Press, vol. 103(5), pages 1039-66, October.
  15. Geanakoplos, John D. & Polemarchakis, Heraklis M., 1982. "We can't disagree forever," Journal of Economic Theory, Elsevier, vol. 28(1), pages 192-200, October.
Full references (including those not matched with items on IDEAS)

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

When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:halshs-00194365. 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: (CCSD)

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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.