IDEAS home Printed from https://ideas.repec.org/p/pad/wpaper/0273.html
   My bibliography  Save this paper

An Implementation Approach to Rotation Programs

Author

Listed:
  • Ville Korpela

    (Turku School of Economics, University of Turku)

  • Michele Lombardi

    (Adam Smith Business School, University of Glasgow and DSES, University of Napoli Federico II)

  • Riccardo D. Saulle

    (Department of Economics and Management, University of Padova)

Abstract

Rotation programs are widely used in societies. Some examples are job rotations, rotation schemes in the management of common-pool resources, and rotation procedures in fair division problems. We study rotation programs via the implementation of Pareto efficient social choice rules under complete information. The notion of the rotation program predicts the outcomes. A rotation program is a myopic stable set whose states are arranged circularly, and agents can effectively move only between two consecutive states. We provide characterizing conditions for the implementation in rotation programs and show that, for multi-valued rules, our notion of rotation monotonicity is necessary and sufficient for implementation. Finally, we identify two classes of assignment problems that are implementable in rotation programs.

Suggested Citation

  • Ville Korpela & Michele Lombardi & Riccardo D. Saulle, 2021. "An Implementation Approach to Rotation Programs," "Marco Fanno" Working Papers 0273, Dipartimento di Scienze Economiche "Marco Fanno".
    • Handle: RePEc:pad:wpaper:0273
    as

    Download full text from publisher

    File URL: https://economia.unipd.it/sites/economia.unipd.it/files/20210273_rev1.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Yu, Jingsheng & Zhang, Jun, 2020. "A market design approach to job rotation," Games and Economic Behavior, Elsevier, vol. 120(C), pages 180-192.
    2. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu, Jingsheng & Zhang, Jun, 2022. "Cores and mechanisms in restricted housing markets," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    2. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    3. Can, Burak & Pourpouneh, Mohsen & Storcken, Ton, 2017. "Cost of transformation: a measure on matchings," Research Memorandum 015, Maastricht University, Graduate School of Business and Economics (GSBE).
    4. Buechel, Berno & Krähenmann, Philemon, 2022. "Fixed price equilibria on peer‐to‐peer platforms: Lessons from time‐based currencies," Journal of Economic Behavior & Organization, Elsevier, vol. 195(C), pages 335-358.
    5. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    6. Battal Doğan & M. Bumin Yenmez, 2023. "When does an additional stage improve welfare in centralized assignment?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(4), pages 1145-1173, November.
    7. Zhiwei Cui & Yan-An Hwang, 2017. "House exchange and residential segregation in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 125-147, March.
    8. Yajing Chen & Zhenhua Jiao & Chenfeng Zhang & Luosai Zhang, 2021. "The Machiavellian frontier of top trading cycles," Papers 2106.14456, arXiv.org, revised Apr 2024.
    9. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    10. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    11. Somdeb Lahiri, 2007. "Core and equilibria in an assembled product industry," Review of Economic Design, Springer;Society for Economic Design, vol. 10(4), pages 327-339, March.
    12. repec:spo:wpecon:info:hdl:2441/5rkqqmvrn4tl22s9mc0o6ctj2 is not listed on IDEAS
    13. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    14. Quesada, Antonio, 2009. "Allocation of objects with conditional property rights," MPRA Paper 19469, University Library of Munich, Germany.
    15. Roth, Alvin E., 1985. "Common and conflicting interests in two-sided matching markets," European Economic Review, Elsevier, vol. 27(1), pages 75-96, February.
    16. Ehlers, Lars & Klaus, Bettina, 2016. "Object allocation via deferred-acceptance: Strategy-proofness and comparative statics," Games and Economic Behavior, Elsevier, vol. 97(C), pages 128-146.
    17. Kumano, Taro, 2013. "Strategy-proofness and stability of the Boston mechanism: An almost impossibility result," Journal of Public Economics, Elsevier, vol. 105(C), pages 23-29.
    18. Bade, Sophie, 2011. "Matching Allocation Problems with Endogenous Information Acquisition," VfS Annual Conference 2011 (Frankfurt, Main): The Order of the World Economy - Lessons from the Crisis 48735, Verein für Socialpolitik / German Economic Association.
    19. Kawasaki, Ryo, 2010. "Farsighted stability of the competitive allocations in an exchange economy with indivisible goods," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 46-52, January.
    20. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    21. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.

    More about this item

    Keywords

    Rotation Programs; Job Rotation; Assignment Problems; Implementation; Right Structures; Stability;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:pad:wpaper:0273. See general information about how to correct material in RePEc.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Raffaele Dei Campielisi (email available below). General contact details of provider: https://edirc.repec.org/data/dspadit.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.