Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions

References

• Airline Business Report Gulf between legacy carriers, auction proponents revealed by mock proposal. Airline Bus. Rep. (2005) 23(2Google Scholar
• Ausubel L. An efficient dynamic auction for heterogeneous commodities. Amer. Econom. Rev. (2006) 26(3):602–629Crossref, Google Scholar
• Ausubel L., Cramton P. The optimality of being efficient. (1999) . Working paper, University of Maryland, College Park, MDGoogle Scholar
• Ausubel L., Milgrom P. Ascending auctions with package bidding. Frontiers Theoret. Econom. (2002) 1(1):1–42Google Scholar
• Ausubel L., Cramton P., Milgrom P., Cramton P., Shoham Y., Steinberg R. The clock-proxy auction: A practical combinatorial auction design. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) 115–138Chap. 5Google Scholar
• Bazaraa M., Sherali H., Shetty C.Nonlinear Programming: Theory and Algorithms (1979) (John Wiley and Sons, New York) Google Scholar
• Clarke E. Multipart pricing of public goods. Public Choice (1971) 11(1):17–33Crossref, Google Scholar
• de Vries S., Schummer J., Vohra R. V. On ascending Vickrey auctions for heterogeneous objects. J. Econom. Theory (2007) 32(1):95–118Crossref, Google Scholar
• Grötschel M., Lovasz L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica (1981) 1(2):169–197Crossref, Google Scholar
• Groves T. Incentives in teams. Econometrica (1973) 41(4):617–631Crossref, Google Scholar
• Günlük O., Ladányi L., de Vries S. A branch-and-price algorithm and new test problems for spectrum auctions. Management Sci. (2005) 51(3):391–406Link, Google Scholar
• Hoffman K., Menon D., van den Heever S., Wilson T., Cramton P., Shoham Y., Steinberg R. Observations and near-direct implementations of the ascending proxy auction. Combinatorial Auctions (2006) (MIT Press, Cambridge, MA) 415–450Chap. 17Google Scholar
• Kwerel E. (2004) . Personal communication. NEXTOR Workshop: Government, the Airline Industry and the Flying Public: A New Way of Doing BusinessGoogle Scholar
• Leyton-Brown K., Pearson M., Shoham Y. Towards a universal test suite for combinatorial auction algorithms. EC '00: Proc. 2nd ACM Conf. Electronic Commerce (2000) (ACM Press, New York) 66–76Crossref, Google Scholar
• Nash J. The bargaining problem. Econometrica (1950) 18(2):155–162Crossref, Google Scholar
• Parkes D. Iterative combinatorial auctions: Achieving economic and computational efficiency. (2001) . Ph.D. thesis, Computer and Information Science, University of Pennsylvania, Philadelphia, PAGoogle Scholar
• Parkes D. Notes on indirect and direct implementations of core outcomes in combinatorial auctions. (2002) . Technical report, Harvard University, Cambridge, MAGoogle Scholar
• Parkes D., Kalagnanam J., Eső M. Achieving budget-balance with Vickrey-based payment schemes in exchanges. Proc. 17th Internat. Joint Conf. Artificial Intelligence (IJCAI'01) (2001) Seattle, WA:1161–1168Google Scholar
• Rothkopf M., Harstad R. Two models of bid-taker cheating in Vickrey auctions. J. Bus. (1995) 68(2):257–267Crossref, Google Scholar
• Rothkopf M., Pekeč A., Harstad R. Computationally manageable combinatorial auctions. Management Sci. (1998) 44(8):1131–1147Link, Google Scholar
• Rothkopf M., Teisberg T., Kahn E. Why are Vickrey auctions rare? J. Political Econom. (1990) 98(1):94–109Crossref, Google Scholar
• Sakurai Y., Yokoo M., Matsubara S. An efficient approximate algorithm for winner determination in combinatorial auctions. EC '00: Proc. 2nd ACM Conf. Electronic Commerce (2000) (ACM Press, New York) 30–37Crossref, Google Scholar
• Vickrey W. Counterspeculation, auctions, and competitive sealed tenders. J. Finance (1961) 16(1):8–37Crossref, Google Scholar
• Wurman P., Zhong J., Cai G. Computing price trajectories in combinatorial auctions with proxy bidding. Electronic Commerce Res. Appl. (2004) 3(4):329–340Crossref, Google Scholar