IDEAS home Printed from https://ideas.repec.org/p/tkk/dpaper/dp34.html
   My bibliography  Save this paper

A conflict-free arbitration scheme in a large population

Author

Listed:
  • Hannu Vartiainen

    () (Department of Economics, Turku School of Economics)

Abstract

This paper studies allocations that can be implemented by an arbitrator subject to the constraint that the agents' outside option is to start bargaining by themselves. As the population becomes large, the set of implementable allocations shrinks to a singleton point - the conflict-free allocation. Finally, the conflict-free allocation can be implemented via a simple "lobbying" game where parties composed of agents with similar preferences bid for the right to be the first proposer in a bargaining game among the parties, i.e. in the "political game".

Suggested Citation

  • Hannu Vartiainen, 2008. "A conflict-free arbitration scheme in a large population," Discussion Papers 34, Aboa Centre for Economics.
  • Handle: RePEc:tkk:dpaper:dp34
    as

    Download full text from publisher

    File URL: http://www.ace-economics.fi/kuvat/dp34.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. Fishburn, Peter C & Rubinstein, Ariel, 1982. "Time Preference," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 23(3), pages 677-694, October.
    2. Kultti, Klaus & Vartiainen, Hannu, 2008. "Bargaining with many players: A limit result," Economics Letters, Elsevier, vol. 101(3), pages 249-252, December.
    3. Kultti Klaus & Vartiainen Hannu, 2007. "Von Neumann-Morgenstern Stable Set Bridges Time-Preferences to the Nash Solution," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 7(1), pages 1-26, November.
    4. Vijay Krishna & Roberto Serrano, 1996. "Multilateral Bargaining," Review of Economic Studies, Oxford University Press, vol. 63(1), pages 61-80.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    non-cooperative bargaining; arbitration; implementation;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tkk:dpaper:dp34. 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: (Aleksandra Maslowska). General contact details of provider: http://edirc.repec.org/data/tukkkfi.html .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.