IDEAS home Printed from https://ideas.repec.org/r/eee/jetheo/v107y2002i2p377-406.html
   My bibliography  Save this item

The Package Assignment Model

Citations

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


Cited by:

  1. Mishra, D. & Talman, A.J.J., 2006. "Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands," Discussion Paper 2006-84, Tilburg University, Center for Economic Research.
  2. Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
  3. 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.
  4. 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.
  5. Laurent Lamy, 2010. "Core-selecting package auctions: a comment on revenue-monotonicity," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 503-510, July.
  6. Núñez, Marina & Rafels, Carlos & Robles, Francisco, 2020. "A mechanism for package allocation problems with gross substitutes," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 6-14.
  7. 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.
  8. Daniel Jaume & Jordi Massó & Alejandro Neme, 2012. "The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 161-187, October.
  9. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
  10. Parag A. Pathak & Alvin E. Roth, 2013. "Matching with Couples: Stability and Incentives in Large Markets," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 128(4), pages 1585-1632.
  11. 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.
  12. Matsushima Hitoshi, 2018. "Connected Price Dynamics with Revealed Preferences and Auctioneer’s Discretion in VCG Combinatorial Auction," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 18(1), pages 1-16, January.
  13. Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CARF F-Series CARF-F-261, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
  14. Lamy, Laurent, 2012. "On minimal ascending auctions with payment discounts," Games and Economic Behavior, Elsevier, vol. 75(2), pages 990-999.
  15. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
  16. 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.
  17. Ravi Bapna & Paulo Goes & Alok Gupta, 2005. "Pricing and Allocation for Quality-Differentiated Online Services," Management Science, INFORMS, vol. 51(7), pages 1141-1150, July.
  18. 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.
  19. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.
  20. 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.
  21. Demange, Gabrielle, 2009. "The strategy structure of some coalition formation games," Games and Economic Behavior, Elsevier, vol. 65(1), pages 83-104, January.
  22. Tuomas Sandholm & Subhash Suri & Andrew Gilpin & David Levine, 2005. "CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions," Management Science, INFORMS, vol. 51(3), pages 374-390, March.
  23. Mete Şeref Ahunbay & Martin Bichler & Johannes Knörr, 2023. "Challenges in Designing Electricity Spot Markets," NBER Chapters, in: New Directions in Market Design, National Bureau of Economic Research, Inc.
  24. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
  25. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
  26. Arribas, I. & Urbano, A., 2017. "Multiproduct trading with a common agent under complete information: Existence and characterization of Nash equilibrium," Journal of Economic Theory, Elsevier, vol. 167(C), pages 14-38.
  27. Lars Ehlers & Bettina Klaus, 2007. "Consistent House Allocation," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 30(3), pages 561-574, March.
  28. 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.
  29. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May.
  30. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," PSE Working Papers halshs-00575076, HAL.
  31. Shirata, Yasuhiro, 2017. "First price package auction with many traders," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 71-83.
  32. 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.
  33. Karla Hoffman & Dinesh Menon, 2010. "A Practical Combinatorial Clock Exchange for Spectrum Licenses," Decision Analysis, INFORMS, vol. 7(1), pages 58-77, March.
  34. Ning Sun & Zaifu Yang, 2014. "An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements," Journal of Political Economy, University of Chicago Press, vol. 122(2), pages 422-466.
  35. Hara, Yusuke & Hato, Eiji, 2018. "A car sharing auction with temporal-spatial OD connection conditions," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 723-739.
  36. de Vries, Sven & Schummer, James & Vohra, Rakesh V., 2007. "On ascending Vickrey auctions for heterogeneous objects," Journal of Economic Theory, Elsevier, vol. 132(1), pages 95-118, January.
  37. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
  38. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
  39. Klemperer, Paul & Baldwin, Elizabeth & Bichler, Martin & Fichtl, Maximilian, 2021. "Strong Substitutes: Structural Properties, and a New Algorithm for Competitive Equilibrium Prices," CEPR Discussion Papers 15831, C.E.P.R. Discussion Papers.
  40. Sano, Ryuji, 2011. "Incentives in core-selecting auctions with single-minded bidders," Games and Economic Behavior, Elsevier, vol. 72(2), pages 602-606, June.
  41. Arribas, I. & Urbano, A., 2018. "Identification of efficient equilibria in multiproduct trading with indivisibilities and non-monotonicity," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 83-94.
  42. Lavi, Ron & Oren, Sigal, 2012. "Side-communication yields efficiency of ascending auctions: The two-items case," Games and Economic Behavior, Elsevier, vol. 76(2), pages 439-456.
  43. 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.
  44. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
  45. Schnizler, Björn & Neumann, Dirk & Veit, Daniel & Napoletano, Mauro & Catalano, Michele & Gallegati, Mauro & Reinicke, Michael & Streitberger, Werner & Eymann, Torsten, 2005. "Environmental analysis for application layer networks," Bayreuth Reports on Information Systems Management 1, University of Bayreuth, Chair of Information Systems Management.
  46. Lahiri, Somdeb, 2008. "Envy-free solutions, Non-linear equilibrium and Egalitarian-equivalence for the Package Assignment Problem," MPRA Paper 8444, University Library of Munich, Germany.
  47. 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.
  48. Delacrétaz, David & Loertscher, Simon & Marx, Leslie M. & Wilkening, Tom, 2019. "Two-sided allocation problems, decomposability, and the impossibility of efficient trade," Journal of Economic Theory, Elsevier, vol. 179(C), pages 416-454.
  49. Peter R. Wurman & Michael P. Wellman, 1999. "Equilibrium Prices in Bundle Auctions," Working Papers 99-09-064, Santa Fe Institute.
  50. Martin Bichler & Zhen Hao & Gediminas Adomavicius, 2017. "Coalition-Based Pricing in Ascending Combinatorial Auctions," Information Systems Research, INFORMS, vol. 28(1), pages 159-179, March.
  51. Blume, Lawrence E. & Easley, David & Kleinberg, Jon & Tardos, Éva, 2009. "Trading networks with price-setting agents," Games and Economic Behavior, Elsevier, vol. 67(1), pages 36-50, September.
  52. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
  53. Somdeb Lahiri, 2006. "Existence of Equilibrium for Integer Allocation Problems," Economics Bulletin, AccessEcon, vol. 28(14), pages 1.
  54. Ryuji Sano, 2016. "Iterative Revelation Mechanisms," KIER Working Papers 937, Kyoto University, Institute of Economic Research.
  55. Sano, Ryuji, 2013. "Vickrey-reserve auctions and an equilibrium equivalence," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 112-117.
  56. Hitoshi Matsushima, 2015. "Connected Price Dynamics with Revealed Preferences and Auctioneer’s Discretionin VCG Combinatorial Auction (Published in the B. E. Journal of Theoretical Economics 18 (1), 2018.)," CARF F-Series CARF-F-359, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
  57. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
  58. Petr Fiala & Petr Šauer, 2011. "Aplikace kombinatorických aukcí na alokaci veřejných podpor v oblasti životního prostředí: ekonomický laboratorní experiment [Application of Combinatorial Auctions on Allocation of Public Financial," Politická ekonomie, Prague University of Economics and Business, vol. 2011(3), pages 379-392.
  59. Paul Karaenke & Martin Bichler & Stefan Minner, 2019. "Coordination Is Hard: Electronic Auction Mechanisms for Increased Efficiency in Transportation Logistics," Management Science, INFORMS, vol. 65(12), pages 5884-5900, December.
  60. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
  61. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
  62. Hitoshi Matsushima, 2010. "Auctioneer's Discretion in Combinatorial Auctions," CARF F-Series CARF-F-293, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo, revised Sep 2012.
  63. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
  64. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," Working Papers halshs-00575076, HAL.
  65. Mingrong Wang & Mingxi Wang & Lihua Lang, 2017. "Reconsidering Carbon Permits Auction Mechanism: An Efficient Dynamic Model," The World Economy, Wiley Blackwell, vol. 40(8), pages 1624-1645, August.
  66. Michael Ryan, 2005. "Applications of a more for less result to labour markets and to auctions," Applied Economics Letters, Taylor & Francis Journals, vol. 12(8), pages 485-488.
  67. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
  68. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
  69. Anthony M. Kwasnica & Katerina Sherstyuk, 2013. "Multiunit Auctions," Journal of Economic Surveys, Wiley Blackwell, vol. 27(3), pages 461-490, July.
  70. Hall, Nicholas G. & Liu, Zhixin, 2011. "On auction protocols for decentralized scheduling," Games and Economic Behavior, Elsevier, vol. 72(2), pages 583-585, June.
  71. Pavlin, J. Michael, 2017. "Dual bounds of a service level assignment problem with applications to efficient pricing," European Journal of Operational Research, Elsevier, vol. 262(1), pages 239-250.
  72. Schneider, S. & Shabalin, P. & Bichler, M., 2010. "On the robustness of non-linear personalized price combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 206(1), pages 248-259, October.
  73. Ivan Arribas & Amparo Urbano, 2004. "Mixed Bundling Strategies And Multiproduct Price Competition," Working Papers. Serie AD 2004-01, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
  74. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
  75. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
  76. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
  77. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
  78. Arribas, Ivan & Urbano, Amparo, 2005. "Nash equilibria in a model of multiproduct price competition: an assignment problem," Journal of Mathematical Economics, Elsevier, vol. 41(3), pages 351-385, April.
  79. Oktay Günlük & Lászlo Ladányi & Sven de Vries, 2005. "A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions," Management Science, INFORMS, vol. 51(3), pages 391-406, March.
  80. Sushil Bikhchandani & Shurojit Chatterjee & Arunava Sen, 2004. "Incentive Compatibility in Multi-unit Auctions," Levine's Bibliography 122247000000000750, UCLA Department of Economics.
  81. Segal, Ilya, 2007. "The communication requirements of social choice rules and supporting budget sets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 341-378, September.
  82. Petr Fiala, 2016. "Supply chain coordination with auctions," Journal of Business Economics, Springer, vol. 86(1), pages 155-171, January.
  83. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
  84. Laurent Lamy, 2007. "The Ausubel-Milgrom Proxy Auction with Final Discounts," Working Papers 2007-25, Center for Research in Economics and Statistics.
  85. Bichler, Martin & Waldherr, Stefan, 2017. "Core and pricing equilibria in combinatorial exchanges," Economics Letters, Elsevier, vol. 157(C), pages 145-147.
  86. Ott, Marion, 2019. "Simple Bayesian and Ex-Post Equilibria in Combinatorial Auctions," VfS Annual Conference 2019 (Leipzig): 30 Years after the Fall of the Berlin Wall - Democracy and Market Economy 203616, Verein für Socialpolitik / German Economic Association.
  87. Paul Milgrom, 2006. "Package Auctions and Package Exchanges: the 2004 Fisher-Schultz Lecture," Levine's Bibliography 321307000000000131, UCLA Department of Economics.
  88. Lukas Hümbs & Alexander Martin & Lars Schewe, 2022. "Exploiting complete linear descriptions for decentralized power market problems with integralities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(3), pages 451-474, June.
  89. Pauline Corblet, 2022. "Returns to education and experience on the labor market : a matching perspective [Les rendements de l'éducation et de l'expérience sur le marché du travail : offre, demande et appariement]," SciencePo Working papers Main tel-03852824, HAL.
  90. Bikhchandani, Sushil & Ostroy, Joseph M., 2006. "Ascending price Vickrey auctions," Games and Economic Behavior, Elsevier, vol. 55(2), pages 215-241, May.
  91. Ilya Segal, 2004. "The Communication Requirements of of Social Choice Rules and Supporting Budget Sets," Economics Working Papers 0039, Institute for Advanced Study, School of Social Science.
  92. Chernomaz, Kirill & Levin, Dan, 2012. "Efficiency and synergy in a multi-unit auction with and without package bidding: An experimental study," Games and Economic Behavior, Elsevier, vol. 76(2), pages 611-635.
  93. Eleni Batziou & Martin Bichler & Maximilian Fichtl, 2022. "Core-Stability in Assignment Markets with Financially Constrained Buyers," Papers 2205.06132, arXiv.org.
  94. Johannes Knorr & Martin Bichler & Teodora Dobos, 2024. "Zonal vs. Nodal Pricing: An Analysis of Different Pricing Rules in the German Day-Ahead Market," Papers 2403.09265, arXiv.org, revised Apr 2024.
  95. Marina Núñez & Francisco Robles, 2023. "Overbidding and underbidding in package allocation problems," UB School of Economics Working Papers 2023/440, University of Barcelona School of Economics.
  96. Thành Nguyen & Karthik Kannan, 2021. "Welfare Implications in Intermediary Networks," Information Systems Research, INFORMS, vol. 32(2), pages 378-393, June.
  97. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
  98. Milind Dawande & R. Chandrashekaran & J. Kalagnanam, 2002. "Using Linear Programming in a Business-to-Business Auction Mechanism," Review of Marketing Science Working Papers 1-4-1002, Berkeley Electronic Press.
  99. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.