IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/hal-00435385.html
   My bibliography  Save this paper

Optimal Assignment of Durable Objects to Successive Agents

Author

Listed:
  • Francis Bloch

    () (Department of Economics, Ecole Polytechnique - Polytechnique - X - CNRS - Centre National de la Recherche Scientifique)

  • Nicolas Houy

    (Department of Economics, Ecole Polytechnique - Polytechnique - X - CNRS - Centre National de la Recherche Scientifique)

Abstract

This paper analyzes the assignment of durable objects to successive generations of agents who live for two periods. The optimal assignment rule is stationary, favors old agents and is determined by a selectivity function which satisfies an iterative functional differential equation. More patient social planners are more selective, as are social planners facing distributions of types with higher probabilities for higher types. The paper also characterizes optimal assignment rules when monetary transfers are allowed and agents face a recovery cost, when agents' types are private information and when agents can invest to improve their types.

Suggested Citation

  • Francis Bloch & Nicolas Houy, 2009. "Optimal Assignment of Durable Objects to Successive Agents," Working Papers hal-00435385, HAL.
  • Handle: RePEc:hal:wpaper:hal-00435385 Note: View the original document on HAL open archive server: https://hal.archives-ouvertes.fr/hal-00435385
    as

    Download full text from publisher

    File URL: https://hal.archives-ouvertes.fr/hal-00435385/document
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    2. Kahn, Charles & Huberman, Gur, 1988. "Two-sided Uncertainty and "Up-or-Out" Contracts," Journal of Labor Economics, University of Chicago Press, vol. 6(4), pages 423-444, October.
    3. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
    4. Carmichael, H Lorne, 1988. "Incentives in Academics: Why Is There Tenure?," Journal of Political Economy, University of Chicago Press, vol. 96(3), pages 453-472, June.
    5. Francis Bloch & David Cantala, 2013. "Markovian assignment rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(1), pages 1-25, January.
    6. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
    7. Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
    8. Waldman, Michael, 1990. "Up-or-Out Contracts: A Signaling Perspective," Journal of Labor Economics, University of Chicago Press, vol. 8(2), pages 230-250, April.
    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


    Cited by:

    1. Atal, Vidya & Bar, Talia & Gordon, Sidartha, 2016. "Project selection: Commitment and competition," Games and Economic Behavior, Elsevier, vol. 96(C), pages 30-48.
    2. Hinnosaar, Toomas, 2017. "Calendar mechanisms," Games and Economic Behavior, Elsevier, vol. 104(C), pages 252-270.
    3. Takashi Kamihigashi, 2014. "Elementary results on solutions to the bellman equation of dynamic programming: existence, uniqueness, and convergence," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 251-273, June.
    4. Takashi Kamihigashi, 2014. "An order-theoretic approach to dynamic programming: an exposition," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 13-21, April.
    5. Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," American Economic Journal: Microeconomics, American Economic Association, vol. 9(1), pages 88-122, February.
    6. Vidya Atal & Talia Bar & Sidartha Gordon, 2013. "Search, Project Adoption and the Fear of Commitment," Sciences Po publications 2013-12, Sciences Po.

    More about this item

    Keywords

    Dynamic Assignment; Durable Objects; Revenue Management; Dynamic Mechanism Design; Overlapping Generations; Promotions and Intertemporal Assignments;

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D73 - Microeconomics - - Analysis of Collective Decision-Making - - - Bureaucracy; Administrative Processes in Public Organizations; Corruption
    • M51 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Personnel Economics - - - Firm Employment Decisions; Promotions

    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:hal:wpaper:hal-00435385. 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). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.