Two Agent Allocation Problems and the First Best

  • Manipushpak Mitra
Part of the New Economic Windows book series (NEW)


We consider a general class of two agent allocation problems and identify the complete class of first best rules. By first best rules we mean allocation rules for which we can find efficient, strategyproof and budget balanced mechanisms. We show that the only first best rules are the fixed share allocation rules.


Allocation Rule Transfer Rule Complete Class Indivisible Good House Allocation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Back, K. and Zender, J. F., 1993. Auctions of Divisible Goods: On the Rationale for the Treasury Experiment. The Review of Financial Studies, 6, 733–764CrossRefGoogle Scholar
  2. 2.
    Clarke, E. H., 1971. Multi-part pricing of public goods. Public Choice 11, 17–33CrossRefGoogle Scholar
  3. 3.
    Fujinaka, Y., Sakai, T., in press. The manipulability of fair solutions in allocation of an indivisible object with money. Journal of Public Economic TheoryGoogle Scholar
  4. 4.
    Groves, T., 1973. Incentives in teams. Econometrica 41, 617–631CrossRefGoogle Scholar
  5. 5.
    Holmström, B., 1979. Groves’ schemes on restricted domains. Econometrica 47, 1137–1144CrossRefGoogle Scholar
  6. 6.
    Miyagawa, E., 2001. House allocation with transfers. Journal of Economic Theory 100, 329355CrossRefGoogle Scholar
  7. 7.
    Ohseto, S., 1999. Strategy-proof allocation mechanisms for economies with an indivisible good. Social Choice and Welfare 16, 121136CrossRefGoogle Scholar
  8. 8.
    Myerson, R., 1979. Incentive-compatibility and the bargaining problem. Econometrica 47, 6173CrossRefGoogle Scholar
  9. 9.
    Ohseto, S., 2000. Strategy-proof and efficient allocation of an indivisible good on finitely restricted preference domains. International Journal of Game Theory 29, 365374CrossRefGoogle Scholar
  10. 10.
    Ohseto, S., 2006. Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods. Economic Theory 29, 111121CrossRefGoogle Scholar
  11. 11.
    Sakai, T., 2007. Fairness and implementability in allocation of indivisible objects with monetary compensations. Journal of Mathematical Economics 43, 549563CrossRefGoogle Scholar
  12. 12.
    Svensson, L.-G., Larsson, B., 2002. Strategy-proof and nonbossy allocation of indivisible goods and money. Economic Theory 20, 483502CrossRefGoogle Scholar
  13. 13.
    Tadenuma, K., Thomson, W., 1993. The fair allocation of an indivisible good when monetary compensations are possible. Mathematical Social Sciences 25, 117132CrossRefGoogle Scholar
  14. 14.
    Vickrey, W., 1961. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance 16, 8–37CrossRefGoogle Scholar
  15. 15.
    Wilson, R. 1979. Auctions of Shares. Quarterly Journal of Economics, 93, 675–698CrossRefGoogle Scholar
  16. 16.
    Yang, S. and Hajek, B., 2004. An efficient mechansim for allocation of a divisible good with its application to network resource allocation, IMA Workshop 6: Control and Pricing in Communication and Power Networks (University of Minnesota)Google Scholar

Copyright information

© Springer-Verlag Italia 2011

Authors and Affiliations

  • Manipushpak Mitra
    • 1
  1. 1.ERU — Indian Statistical InstituteKolkataIndia

Personalised recommendations