A Matter of Equality: Linear Pricing in Combinatorial Exchanges

Published Online:https://doi.org/10.1287/isre.2017.0766

References

  • Adomavicius G, Gupta A (2005) Toward comprehensive real-time bidder support in iterative combinatorial auctions. Inform. Systems Res. 16(2):169–185.LinkGoogle Scholar
  • Adomavicius G, Curley S, Gupta A, Sanyal P (2012) Effect of information feedback on bidder behavior in continuous combinatorial auctions. Management Sci. 58(4):811–830.LinkGoogle Scholar
  • Arrow KJ, Debreu G (1954) Existence of an equilibrium for a competitive economy. Econometrica 22(3)265–290.CrossrefGoogle Scholar
  • Azevedo EM, Weyl EG, White A (2013) Walrasian equilibrium in large, quasilinear markets. Theoret. Econom. 8(2):281–290.CrossrefGoogle Scholar
  • Baldwin E, Klemperer P (2018) Understanding preferences: “Demand types,” and the existence of equilibrium with indivisibilities. Accessed September 14, 2018, http://dx.doi.org/10.2139/ssrn.2643086.Google Scholar
  • Bichler M, Shabalin P, Pikovsky A (2009) A computational analysis of linear price iterative combinatorial auction formats. Inform. Systems Res. 20(1):33–59.LinkGoogle Scholar
  • Bichler M, Goeree J, Mayer S, Shabalin P (2014) Spectrum auction design: Simple auctions for complex sales. Telecomm. Policy 38(7):613–622.CrossrefGoogle Scholar
  • Bikhchandani S, Mamer JW (1997) Competitive equilibrium in an exchange economy with indivisibilities. J. Econom. Theory 74(2):385–413.CrossrefGoogle Scholar
  • Blumrosen L, Nisan N (2007) Combinatorial auctions. Nisa N, Roughgarden T, Tardos E, Vazirani VV, eds. Algorithmic Game Theory (Cambridge University Press, New York), 267–300.CrossrefGoogle Scholar
  • Brunner C, Goeree JK, Holt CA, Ledyard JO (2010) An experimental test of flexible combinatorial spectrum auction formats. Amer. Econom. J.: Microeconomics 2(1):39–57.CrossrefGoogle Scholar
  • Casella G, Berger RL (2002) Statistical Inference, Vol. 2 (Duxbury, Pacific Grove, CA).Google Scholar
  • Cason T, Kannan K, Siebert R (2011) An experimental study of information revelation policies in sequential auctions. Management Sci. 57(4):667–688.LinkGoogle Scholar
  • Cramton PC, Shoham Y, Steinberg R, eds. (2006) Combinatorial Auctions, Vol. 475 (MIT Press, Cambridge, MA).Google Scholar
  • Day R (2013) The division of surplus in efficient combinatorial exchanges. Accessed September 14, 2018, http://dx.doi.org/10.2139/ssrn.2207067.Google Scholar
  • de Vries S, Vohra R (2003) Combinatorial auctions: A survey. INFORMS J. Comput. 15(3):284–309.LinkGoogle Scholar
  • Farrell MJ (1959) The convexity assumption in the theory of competitive markets. J. Political Econom. 67(4):377–391.CrossrefGoogle Scholar
  • Georgescu-Roegen N (1979) Methods in economic science. J. Econom. Issues 13(2):317–328.CrossrefGoogle Scholar
  • Gomory RE, Baumol WJ (1960) Integer programming and pricing. Econometrica 28(3):521–550.CrossrefGoogle Scholar
  • Green J, Laffont J-J (1977) Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica 45(2):427–438.CrossrefGoogle Scholar
  • Gul F, Stacchetti E (1999) Walrasian equilibrium with gross substitutes. J. Econom. Theory 87(1):95–124.CrossrefGoogle Scholar
  • Guo Z, Koehler G, Whinston A (2012) A computational analysis of bundle trading markets design for distributed resource allocation. Inform. Systems Res. 23(3-part-1):823–843.LinkGoogle Scholar
  • Iftekhar MS, Tisdell JG (2012) Comparison of simultaneous and combinatorial auction designs in fisheries quota market. Marine Policy 36(2):446–453.CrossrefGoogle Scholar
  • Innes J, Thébaud O, Norman-López A, Little LR, Kung J (2014) Evidence of package trading in a mature multi-species ITQ market. Marine Policy 46(May):68–71.CrossrefGoogle Scholar
  • Kelso AS, Crawford VP (1982) Job matching, coalition formation, and gross substitute. Econometrica 50(6):1483–1504.CrossrefGoogle Scholar
  • Ketter W, Collins J, Gini M, Gupta A, Schrater P (2012) Real-time tactical and strategic sales management for intelligent agents guided by economic regimes. Inform. Systems Res. 23(4):1263–1283.LinkGoogle Scholar
  • Kwasnica T, Ledyard JO, Porter D, DeMartini C (2005) A new and improved design for multi-objective iterative auctions. Management Sci. 51(3):419–434.LinkGoogle Scholar
  • Lubin B, Juda AI, Cavallo R, Lahaie S, Shneidman J, Parkes DC (2008) ICE: An expressive iterative combinatorial exchange. J. Artificial Intelligence Res. 33:33–37.CrossrefGoogle Scholar
  • McKenzie LW (1959) On the existence of general equilibrium for a competitive market. Econometrica 27(1)54–71.CrossrefGoogle Scholar
  • Meeus L, Verhaegen K, Belmans R (2009) Block order restrictions in combinatorial electric energy auctions. Eur. J. Oper. Res. 196(3):1202–1206.CrossrefGoogle Scholar
  • Milgrom P (2000) Putting auction theory to work: The simultaneous ascending auction. J. Political Econom. 108(21):245–272.CrossrefGoogle Scholar
  • Myerson RB, Satterthwaite MA (1983) Efficient mechanisms for bilateral trading. J. Econom. Theory 29(2):265–281.CrossrefGoogle Scholar
  • Nemes V, Plott CR, Stoneham G (2008) Electronic BushBroker exchange: Designing a combinatorial double auction for native vegetation offsets. Accessed September 14, 2018, http://dx.doi.org/10.2139/ssrn.1212202.Google Scholar
  • O’Neill RP, Sotkiewicz PM, Hobbs BF, Rothkopf MH, Stewart WR (2005) Efficient market-clearing prices in markets with nonconvexities. Eur. J. Oper. Res. 1(164):269–285.CrossrefGoogle Scholar
  • Parkes DC, Kalagnanam J, Eso M (2001) Achieving budget-balance with Vickrey-based payment schemes in exchanges. Proc. 17th Internat. Joint Conf. Artificial Intelligence (Morgan Kaufman, San Francisco), 1161–1168.Google Scholar
  • Petrakis I, Ziegler G, Bichler M (2013) Ascending combinatorial auctions with allocation constraints: On game-theoretical and computational properties of generic pricing rules. Inform. Systems Res. 24(3):768–786.LinkGoogle Scholar
  • Roberts DJ, Postlewaite A (1976) The incentives for price-taking behavior in large exchange economies. Econometrica 44(1):115–127.CrossrefGoogle Scholar
  • Rustichini A, Satterthwaite MA, Williams SR (1994) Convergence to efficiency in a simple market with incomplete information. Econometrica 62(5):1041–1063.CrossrefGoogle Scholar
  • Scheffel T, Pikovsky A, Bichler M, Guler K (2011) An experimental comparison of linear and nonlinear price combinatorial auctions. Inform. Systems Res. 22(2):346–368.LinkGoogle Scholar
  • Shapley LS, Shubik M (1971) The assignment game I: The core. Internat. J. Game Theory 1(1):111–130.CrossrefGoogle Scholar
  • Starr RM (1969) Quasi-equilibria in markets with non-convex preferences. Econometrica 37(1):25–38.CrossrefGoogle Scholar
  • Van Vyve M (2011) Linear prices for non-convex electricity markets: Models and algorithms. Report, Center for Operations Research and Econometrics, Université catholique de Louvain, Louvain-la-Neuve, Belgium.Google Scholar
  • Wang X, Kopfer H (2014) Collaborative transportation planning of less-than-truckload freight. OR Spectrum 36(2):357–380.CrossrefGoogle Scholar
  • Whittaker ET, Watson GN (1990) A Course of Modern Analysis (Cambridge University Press, Cambridge, UK).Google Scholar
  • Wolsey LA (1981) Integer programming duality: Price functions and sensitivity analysis. Math. Programming 20(1):173–195.CrossrefGoogle Scholar
  • Xia M, Koehler GJ, Whinston AB (2004) Pricing combinatorial auctions. Eur. J. Oper. Res. 154(1):251–270.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.