IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v154y2004i1p251-270.html
   My bibliography  Save this article

Pricing combinatorial auctions

Author

Listed:
  • Xia, Mu
  • Koehler, Gary J.
  • Whinston, Andrew B.

Abstract

No abstract is available for this item.

Suggested Citation

  • Xia, Mu & Koehler, Gary J. & Whinston, Andrew B., 2004. "Pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 154(1), pages 251-270, April.
    • Handle: RePEc:eee:ejores:v:154:y:2004:i:1:p:251-270
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00678-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James C. Moore & Andrew B. Whinston & Joseph S. Wu, 1972. "Resource Allocation in a Non-convex Economy," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 39(3), pages 303-323.
    2. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    3. Peter R. Wurman & Michael P. Wellman, 1999. "Equilibrium Prices in Bundle Auctions," Working Papers 99-09-064, Santa Fe Institute.
    4. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    5. Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-479, June.
    6. Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680.
    7. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    8. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    9. Sulin Ba & Jan Stallaert & Andrew B. Whinston, 2001. "Optimal Investment in Knowledge Within a Firm Using a Market Mechanism," Management Science, INFORMS, vol. 47(9), pages 1203-1219, September.
    10. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Column aggregation-based pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 624, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Dirk Briskorn & Kurt Jørnsten & Jenny Nossack, 2016. "Pricing combinatorial auctions by a set of linear price vectors," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 1043-1070, October.
    3. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    4. Proano, Ruben A. & Jacobson, Sheldon H. & Zhang, Wenbo, 2012. "Making combination vaccines more accessible to low-income countries: The antigen bundle pricing problem," Omega, Elsevier, vol. 40(1), pages 53-64, January.
    5. Meeus, Leonardo & Verhaegen, Karolien & Belmans, Ronnie, 2009. "Block order restrictions in combinatorial electric energy auctions," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1202-1206, August.
    6. A Drexl & K Jørnsten, 2007. "Reflections about pseudo-dual prices in combinatorial auctions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1652-1659, December.
    7. Ensthaler, Ludwig & Giebe, Thomas, 2014. "Bayesian optimal knapsack procurement," European Journal of Operational Research, Elsevier, vol. 234(3), pages 774-779.
    8. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2009. "Non-linear anonymous pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 296-302, November.
    9. Matzke, Andreas & Volling, Thomas & Spengler, Thomas S., 2016. "Upgrade auctions in build-to-order manufacturing with loss-averse customers," European Journal of Operational Research, Elsevier, vol. 250(2), pages 470-479.
    10. Ioannis Petrakis & Georg Ziegler & Martin Bichler, 2013. "Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules," Information Systems Research, INFORMS, vol. 24(3), pages 768-786, September.
    11. Andor Goetzendorff & Martin Bichler & Pasha Shabalin & Robert W. Day, 2015. "Compact Bid Languages and Core Pricing in Large Multi-item Auctions," Management Science, INFORMS, vol. 61(7), pages 1684-1703, July.
    12. Martin Bichler & Johannes Knörr & Felipe Maldonado, 2023. "Pricing in Nonconvex Markets: How to Price Electricity in the Presence of Demand Response," Information Systems Research, INFORMS, vol. 34(2), pages 652-675, June.
    13. Martin Bichler & Pasha Shabalin & Alexander Pikovsky, 2009. "A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats," Information Systems Research, INFORMS, vol. 20(1), pages 33-59, March.
    14. R. H. Kwon & G. Anandalingam & L. H. Ungar, 2005. "Iterative Combinatorial Auctions with Bidder-Determined Combinations," Management Science, INFORMS, vol. 51(3), pages 407-418, March.
    15. Martin Bichler & Pasha Shabalin & Georg Ziegler, 2013. "Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction," Information Systems Research, INFORMS, vol. 24(2), pages 394-417, June.
    16. Kemal Guler & Martin Bichler & Ioannis Petrakis, 2016. "Ascending Combinatorial Auctions with Risk Averse Bidders," Group Decision and Negotiation, Springer, vol. 25(3), pages 609-639, May.
    17. Martin Bichler & Vladimir Fux & Jacob Goeree, 2018. "A Matter of Equality: Linear Pricing in Combinatorial Exchanges," Information Systems Research, INFORMS, vol. 29(4), pages 1024-1043, December.
    18. Schellhorn, Henry, 2011. "A trading mechanism contingent on several indices," European Journal of Operational Research, Elsevier, vol. 213(3), pages 551-558, September.
    19. Tobias Scheffel & Alexander Pikovsky & Martin Bichler & Kemal Guler, 2011. "An Experimental Comparison of Linear and Nonlinear Price Combinatorial Auctions," Information Systems Research, INFORMS, vol. 22(2), pages 346-368, June.
    20. Lorentziadis, Panos L., 2008. "Pricing in multiple-item procurement auctions with a common to all items fixed cost," European Journal of Operational Research, Elsevier, vol. 190(3), pages 790-797, November.
    21. Avenali, Alessandro, 2009. "Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule," European Journal of Operational Research, Elsevier, vol. 199(1), pages 262-275, November.
    22. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    2. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    3. Ravi Bapna & Sanjukta Das & Robert Garfinkel & Jan Stallaert, 2008. "A Market Design for Grid Computing," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 100-111, February.
    4. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    5. Yokoo, Makoto & Sakurai, Yuko & Matsubara, Shigeo, 2004. "The effect of false-name bids in combinatorial auctions: new fraud in internet auctions," Games and Economic Behavior, Elsevier, vol. 46(1), pages 174-188, January.
    6. Henry Schellhorn, 2004. "A Double-Sided Multiunit Combinatorial Auction for Substitutes: Theory and Algorithms," FAME Research Paper Series rp123, International Center for Financial Asset Management and Engineering.
    7. Wurman, Peter R. & Wellman, Michael P. & Walsh, William E., 2001. "A Parametrization of the Auction Design Space," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 304-338, April.
    8. William H. Sandholm, 2005. "Negative Externalities and Evolutionary Implementation," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 72(3), pages 885-915.
    9. Takashi Kunimoto & Cuiling Zhang, 2021. "On incentive compatible, individually rational public good provision mechanisms," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(2), pages 431-468, August.
    10. Philippe Jehiel & Laurent Lamy, 2018. "A Mechanism Design Approach to the Tiebout Hypothesis," Journal of Political Economy, University of Chicago Press, vol. 126(2), pages 735-760.
    11. Yoon, Kiho, 2008. "The participatory Vickrey-Clarke-Groves mechanism," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 324-336, February.
    12. Bierbrauer, Felix & Netzer, Nick, 2016. "Mechanism design and intentions," Journal of Economic Theory, Elsevier, vol. 163(C), pages 557-603.
    13. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
    14. Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July.
    15. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
    16. Matthias Lang, 2020. "Mechanism Design with Narratives," CESifo Working Paper Series 8502, CESifo.
    17. Wang, Pengfei & Guan, Hongzhi & Liu, Peng, 2020. "Modeling and solving the optimal allocation-pricing of public parking resources problem in urban-scale network," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 74-98.
    18. Ervasti, Valtteri & Leskelä, Riikka-Leena, 2010. "Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support," European Journal of Operational Research, Elsevier, vol. 203(1), pages 251-260, May.
    19. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    20. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:154:y:2004:i:1:p:251-270. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.