Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions

References

• Ausubel L. M., Milgrom P., Cramton P., Shoham Y., Steinberg R. The lovely but lonely Vickrey auction. Combinatorial Auctions (2005) (MIT Press, Cambridge, MA) 17–40Crossref, Google Scholar
• Ball M. O., Donohue G. L., Hoffman K., Cramton P., Shoham Y., Steinberg R. Auctions for the safe, efficient, and equitable allocation of airspace system resources. Combinatorial Auctions (2005) (MIT Press, Cambridge, MA) 507–538Crossref, Google Scholar
• Bevia C., Quinzii M., Silva J. A. Buying several indivisible goods. Math. Soc. Sci. (1999) 37(1):1–23Crossref, Google Scholar
• Bikhchandani S., Mamer J. W. Competitive equilibrium in an exchange economy with indivisibilities. J. Econom. Theory (1997) 74(2):385–413Crossref, Google Scholar
• Bikhchandani S., de Vries S., Schummer J., Vohra R., Dietrich B., Vohra R. V. Linear programming and Vickrey auctions. Mathematics of the Internet: E-Auction and Markets (2002) (Springer, New York) 75–116Crossref, Google Scholar
• Bleischwitz Y., Kliewer G. Accelerating Vickrey payment computation in combinatorial auctions for an airline alliance. WEA '05: Proc. 4th Internat. Workshop Experiment. Efficient Algorithms (2005) 3503(Springer, Berlin) 228–239Lecture Notes in Computer ScienceCrossref, Google Scholar
• Cantillon E., Pesendorfer M., Cramton P., Shoham Y., Steinberg R. Auctioning bus routes: The London experience. Combinatorial Auctions (2005) (MIT Press, Cambridge, MA) 573–591Crossref, Google Scholar
• Caplice C., Sheffi Y., Cramton P., Shoham Y., Steinberg R. Combinatorial auctions for truckload transportation. Combinatorial Auctions (2005) (MIT Press, Cambridge, MA) 539–571Crossref, Google Scholar
• Cramton P., Shoham Y., Steinberg R.Combinatorial Auctions (2005) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Day R. W. Expressing preferences with price-vector agents in combinatorial auctions. (2004) . Ph.D. thesis, University of Maryland, College ParkGoogle Scholar
• Day R. W., Raghavan S. Matrix bidding in combinatorial auctions. Oper. Res. (2009) 57(4):916–933Link, Google Scholar
• de Vries S., Vohra R. V. Combinatorial auctions: A survey. INFORMS J. Comput. (2003) 15(3):284–309Link, Google Scholar
• Dobzinski S., Nisan N., Schapira M. Approximation algorithms for combinatorial auctions with complement-free bidders. STOC '05: Proc. 37th Ann. ACM Sympos. Theory of Comput. (2005) Baltimore(ACM Press, New York) 610–618Crossref, Google Scholar
• Epstein R., Henríquez L., Catalán J., Weintraub G. Y., Martínez C. A combinational auction improves school meals in Chile. Interfaces (2002) 32(6):1–14Link, Google Scholar
• Eso M., Dietrich B., Vohra R. V. An iterative online auction for airline seats. Mathematics of the Internet: E-Auction and Markets (2001) (Springer-Verlag, Berlin) 45–58Google Scholar
• Fujishige S., Yang Z. A note on Kelso and Crawford's gross substitutes condition. Math. Oper. Res. (2003) 28(3):463–469Link, Google Scholar
• Goossens D. R., Spieksma F. C. R. Exact algorithms for the matrix bid auction. Comput. Oper. Res. (2009) 36(4):1090–1109Crossref, Google Scholar
• Goossens D. R., Maas A. J. T., Spieksma F. C. R., van de Klundert J. J. Exact algorithms for procurement problems under a total quantity discount structure. Eur. J. Oper. Res. (2007) 178(2):603–626Crossref, Google Scholar
• Grötschel M., Lovász L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica (1981) 1(2):169–197Crossref, Google Scholar
• Gul F., Stacchetti E. Walrasian equilibrium with gross substitutes. J. Econom. Theory (1999) 87(1):95–124Crossref, Google Scholar
• Hohner G., Rich J., Ng E. d., Reid G., Davenport A. J., Kalagnanam J. R., Lee H. S., An C. Combinatorial and quantity-discount procurement auctions benefit Mars, Incorporated and its suppliers. Interfaces (2003) 33(1):23–35Link, Google Scholar
• Kelso A. S., Crawford V. P. Job matching, coalition formation, and gross substitutes. Econometrica (1982) 50(6):1483–1504Crossref, Google Scholar
• Khot S., Lipton R. J., Markakis E., Mehta A. Inapproximability results for combinatorial auctions with submodular utility functions. WINE '05: Proc. 1st Internat. Workshop on Internet and Network Econom. (2005) Hong Kong, China(Springer, New York) 92–101Crossref, Google Scholar
• Ledyard J. O., Olson M., Porter D., Swanson J. A., Torma D. P. The first use of a combined-value auction for transportation services. Interfaces (2002) 32(5):4–12Link, Google Scholar
• Lehmann B., Lehmann D., Nisan N. Combinatorial auctions with decreasing marginal utilities. Games Econom. Behav. (2006) 55(2):270–296Crossref, Google Scholar
• Leyton-Brown K., Shoham Y., Cramton P., Shoham Y., Steinberg R. A test suite for combinatorial auctions. Combinatorial Auctions (2005) (MIT Press, Cambridge, MA) 451–478Crossref, Google Scholar
• Leyton-Brown K., Shoham Y., Tennenholtz M. An algorithm for multi-unit combinatorial auctions. AAAI/IAAI '00: Proc. 17th National Conf. Artificial Intelligence 12th Conf. Innovative Appl. Artificial Intelligence (2000) Austin(AAAI Press/The MIT Press, Menlo Park, CA) 56–61Google Scholar
• Moulin H.Axioms of Cooperative Decision Making (1988) (Cambridge University Press, New York) Crossref, Google Scholar
• Murota K., Tamura A. New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. Discrete Appl. Math. (2003) 131(2):495–512Crossref, Google Scholar
• Nisan N. Bidding and allocation in combinatorial auctions. EC '00: Proc. 2nd ACM Conf. Electronic Commerce (2000) Minneapolis(ACM Press, New York) 1–12Crossref, Google Scholar
• Nisan N., Cramton P., Shoham Y., Steinberg R. Bidding languages for combinatorial auctions. Combinatorial Auctions (2005) (MIT Press, Cambridge, MA) 215–231Crossref, Google Scholar
• Nisan N., Segal I. The communication requirements of efficient allocations and supporting prices. J. Econom. Theory (2006) 129(1):192–224Crossref, Google Scholar
• Rassenti S. J., Smith V. L., Bulfin R. L. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econom. (1982) 13(2):402–417Crossref, Google Scholar
• Reijnierse H., van Gellekom A., Potters J. A. M. Verifying gross substitutability. Econom. Theory (2002) 20(4):767–776Crossref, Google Scholar
• Rothkopf M. H., Pekeç A., Harstad R. M. Computationally manageable combinational auctions. Management Sci. (1998) 44(8):1131–1147Link, Google Scholar
• Sandholm T. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence (2002) 135(1-2):1–54Crossref, Google Scholar
• Sandholm T., Suri S., Gilpin A., Levine D. Winner determination in combinatorial auction generalizations. AAMAS '02: Proc. First Internat. Joint Conf. Autonomous Agents and Multiagent Systems (2002) Bologna, Italy(ACM Press, New York) 69–76Crossref, Google Scholar
• Sandholm T., Suri S., Gilpin A., Levine D. CABOB: A fast optimal algorithm for winner determination in combinatorial auctions. Management Sci. (2005) 51(3):374–390Link, Google Scholar
• Sheffi Y. Combinatorial auctions in the procurement of transportation services. Interfaces (2004) 34(4):245–252Link, Google Scholar