Startseite Efficient Combinatorial Allocations: Individual Rationality versus Stability
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Efficient Combinatorial Allocations: Individual Rationality versus Stability

  • Hitoshi Matsushima EMAIL logo
Veröffentlicht/Copyright: 4. Januar 2018

Abstract

We investigate combinatorial allocations with opt-out types and clarify the possibility of achieving efficiency under incomplete information. We introduce two distinct collective decision procedures. The first procedure assumes that the central planner designs a mechanism and players have the option to exit. The mechanism requires interim individual rationality. The second procedure assumes that players design a mechanism by committing themselves to participate. The mechanism requires marginal stability against blocking behavior by the largest proper coalitions. We show that the central planner can earn non-negative revenue in the first procedure, if and only if he cannot do so in the second.

JEL Classification: D44; D61; D82

Notes

This study was supported by a grant-in-aid for scientific research (KAKENHI 25285059) from the Japan Society for the Promotion of Science (JSPS) and the Ministry of Education, Culture, Sports, Science and Technology (MEXT) of the Japanese government.


Appendix

Proof of Lemma 1

From payoff equivalence, without loss of generality, we can assume x~X^. According to Arrow (1979) and D’Aspremont and Gérard-Varet (1979), it is evident that there exists xX such that (g,x) satisfies BIC and the balanced budgets in the sense that

iNxi(ω)=0 for all ωΩ.

From payoff equivalence, it is evident that there exists (bi)iNRn such that

E[x~i(ω)|ωi]=E[xi(ω)|ωi]+bi for all iN and all ωiΩi,

where note that

iNbi=E[iNx~i(ω)].

We specify xX by

xi(ω)=xi(ω)+bi for all iN and all ωΩ.

From this specification, it is clear that (g,x) satisfies BIC,

E[xi(ω)|ωi]=E[xi(ω)|ωi]+bi

=E[x~i(ω)|ωi] for all iN and ωiΩi,

and

iNxi(ω)=iNxi(ω)+iNbi=E[iNx~i(ω)] for all ωΩ.

References

Arrow, K. 1979. “The Property Rights Doctrine and Demand Revelation under Incomplete Information.” In Economics and Human Welfare, edited by M. Boskin. New York: Academic Press.Suche in Google Scholar

Ausubel, L., and P. Milgrom. 2002. “Ascending Auctions with Package Bidding.” Frontier of Theoretical Economics 1:1–42.Suche in Google Scholar

Bikhchandani, S., S. Chatterji, R. Lavi, A. Mu’alem, N. Nisan, and A. Sen. 2006. “Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation.” Econometrica 74:1109–1132.10.1111/j.1468-0262.2006.00695.xSuche in Google Scholar

Cramton, P. (2011): “Incentive Auctions and Spectrum Policy.” Working Paper. University of Maryland.Suche in Google Scholar

Cramton, P., R. Gibbons, and P. Klemperer. 1987. “Dissolving a Partnership Efficiently.” Econometrica 55:615–632.10.2307/1913602Suche in Google Scholar

Cramton, P., Y. Shoham, and R. Steinberg. 2006. Combinatorial Auctions. Cambridge: MIT Press.10.7551/mitpress/9780262033428.001.0001Suche in Google Scholar

D’Aspremont, C., and L. Gérard-Varet. 1979. “Incentive and Incomplete Information.” Journal of Public Economics 11:25–45.10.1016/0047-2727(79)90043-4Suche in Google Scholar

Green, J., and -J.-J. Laffont. 1977. “Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods.” Econometrica 45:427–438.10.2307/1911219Suche in Google Scholar

Groves, T. 1973. “Incentives in Teams.” Econometrica 61:617–631.10.2307/1914085Suche in Google Scholar

Hazlett, T., D. Porter, and V. Smith (2012): “Incentive Auctions: Economic and Strategic Issues.” mimeo.Suche in Google Scholar

Holmstrom, B. 1979. “Groves Schemes on Restricted Domains.” Econometrica 47:1137–1144.10.2307/1911954Suche in Google Scholar

Kelso, A., and V. Crawford. 1982. “Job Matching, Coalition Formation, and Gross Substitutes.” Econometrica 50:1483.10.2307/1913392Suche in Google Scholar

Krishna, V., and E. Maenner. 2001. “Convex Potentials with an Application to Mechanism Design.” Econometrica 69:1113–1119.10.1111/1468-0262.00233Suche in Google Scholar

Krishna, V., and M. Perry. 2000. Efficient Mechanism Design. mimeo. Philadelphia: Penn. State University.Suche in Google Scholar

Makowski, L., and J. Ostroy (1989): “Efficient and Individually Rational Bayesian Mechanisms Only Exist on Perfectly Competitive Environments.” UCLE Department of Economics, Discussion Paper 566.Suche in Google Scholar

Milgrom, P. 2004. Putting Auction Theory to Work. Cambridge, UK: Cambridge University Press.10.1017/CBO9780511813825Suche in Google Scholar

Milgrom, P. 2007. “Package Auctions and Exchanges.” Econometrica 75:935–965.10.1111/j.1468-0262.2007.00778.xSuche in Google Scholar

Milgrom, P., L. Ausubel, J. Levin, and I. Segal (2012): “Incentive Auction Rules Option and Discussion.” mimeo.Suche in Google Scholar

Milgrom, P., and I. Segal. 2002. “Envelope Theorem for Arbitrary Choice Space.” Econometrica 70:583–601.10.1111/1468-0262.00296Suche in Google Scholar

Myerson, R., and M. Satterthwaite. 1983. “Efficient Mechanisms for Bilateral Trading.” Journal of Economic Theory 29:265–281.10.1016/0022-0531(83)90048-0Suche in Google Scholar

Rassenti, S., R. Bulfin, and V. Smith. 1982. “A Combinatorial Auction Mechanism for Airport Time Slot Allocation.” Bell Journal of Economics 13:402–417.10.2307/3003463Suche in Google Scholar

Segal, I., and M. Whinston. 2010. “Property Rights.” In Handbook of Organizational Economics, edited by R. Gibons and J. Roberts. Princeton: Princeton University Press.Suche in Google Scholar

Williams, S. 1999. “A Characterization of Efficient, Bayesian Incentive Compatible Mechanisms.” Economic Theory 14:155–180.10.1007/s001990050286Suche in Google Scholar

Published Online: 2018-01-04

© 2019 Walter de Gruyter GmbH, Berlin/Boston

Heruntergeladen am 18.11.2025 von https://www.degruyterbrill.com/document/doi/10.1515/bejte-2017-0072/pdf
Button zum nach oben scrollen