IDEAS home Printed from https://ideas.repec.org/r/eee/gamebe/v55y2006i2p270-296.html

Combinatorial auctions with decreasing marginal utilities

Citations

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


Cited by:

  1. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
  2. Itai Ashlagi & Maximilien Burq & Chinmoy Dutta & Patrick Jaillet & Amin Saberi & Chris Sholley, 2023. "Edge-Weighted Online Windowed Matching," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 999-1016, May.
  3. Anna Bogomolnaia & Hervé Moulin, 2025. "Fair division with money and prices: bid & sell versus divide & choose," Theory and Decision, Springer, vol. 99(1), pages 407-443, September.
  4. Georgios Amanatidis & Georgios Birmpas & Philip Lazos & Stefano Leonardi & Rebecca Reiffenhäuser, 2025. "Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria," Mathematics of Operations Research, INFORMS, vol. 50(4), pages 2717-2737, November.
  5. Ostrovsky, Michael & Paes Leme, Renato, 2015. "Gross substitutes and endowed assignment valuations," Theoretical Economics, Econometric Society, vol. 10(3), September.
  6. Mariam Lafkihi & Shenle Pan & Eric Ballot, 2025. "Game—The Freight Transportation Game: Operational Challenges for Carriers in Online Spot Market Platforms," INFORMS Transactions on Education, INFORMS, vol. 26(1), pages 91-101, September.
  7. Paul Duetting & Michal Feldman & Inbal Talgam-Cohen, 2024. "Algorithmic Contract Theory: A Survey," Papers 2412.16384, arXiv.org.
  8. Dobzinski, Shahar & Fu, Hu & Kleinberg, Robert, 2015. "Approximately optimal auctions for correlated bidders," Games and Economic Behavior, Elsevier, vol. 92(C), pages 349-369.
  9. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  10. Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
  11. Itai Sher, 2012. "Optimal shill bidding in the VCG mechanism," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 50(2), pages 341-387, June.
  12. Goossens, D.R. & Müller, R.J. & Spieksma, F.C.R., 2007. "Matrix bids in combinatorial auctions: expressiveness and micro-economic properties," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  13. Yuval Emek & Ron Lavi & Rad Niazadeh & Yangguang Shi, 2024. "Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 49(2), pages 880-900, May.
  14. Georgios Amanatidis & Pieter Kleer & Guido Schäfer, 2022. "Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online," Mathematics of Operations Research, INFORMS, vol. 47(3), pages 2286-2309, August.
  15. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian, 2021. "Maximizing Sequence-Submodular Functions and Its Application to Online Advertising," Management Science, INFORMS, vol. 67(10), pages 6030-6054, October.
  16. Qinqin Gong & Ling Gai & Yanjun Jiang & Yang Lv & Ruiqi Yang, 2025. "Approximating combinatorial contracts with a cardinality constraint," Journal of Combinatorial Optimization, Springer, vol. 49(5), pages 1-16, July.
  17. Cheng Lu & Wenguo Yang & Ruiqi Yang & Suixiang Gao, 2022. "Maximizing a non-decreasing non-submodular function subject to various types of constraints," Journal of Global Optimization, Springer, vol. 83(4), pages 727-751, August.
  18. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
  19. Maxim Sviridenko & Jan Vondrák & Justin Ward, 2017. "Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1197-1218, November.
  20. Sébastien Lahaie & Benjamin Lubin, 2025. "Adaptive Pricing in Combinatorial Auctions," Management Science, INFORMS, vol. 71(10), pages 8967-8993, October.
  21. Yijing Wang & Dachuan Xu & Yishui Wang & Dongmei Zhang, 2020. "Non-submodular maximization on massive data streams," Journal of Global Optimization, Springer, vol. 76(4), pages 729-743, April.
  22. Fu, Hu & Kleinberg, Robert & Lavi, Ron & Smorodinsky, Rann, 2017. "Stability and auctions in labor markets with job security," Economics Letters, Elsevier, vol. 154(C), pages 55-58.
  23. Fu, Hu & Kleinberg, Robert & Lavi, Ron & Smorodinsky, Rann, 2017. "Job security, stability and production efficiency," Theoretical Economics, Econometric Society, vol. 12(1), January.
  24. Dobzinski, Shahar & Nisan, Noam & Oren, Sigal, 2019. "Economic efficiency requires interaction," Games and Economic Behavior, Elsevier, vol. 118(C), pages 589-608.
  25. Feldman, Michal & Shabtai, Galia, 2023. "Simultaneous 2nd price item auctions with no-underbidding," Games and Economic Behavior, Elsevier, vol. 140(C), pages 316-340.
  26. Blumrosen, Liad & Dobzinski, Shahar, 2021. "(Almost) efficient mechanisms for bilateral trading," Games and Economic Behavior, Elsevier, vol. 130(C), pages 369-383.
  27. Yuval Filmus & Yasushi Kawase & Yusuke Kobayashi & Yutaro Yamaguchi, 2021. "Tight Approximation for Unconstrained XOS Maximization," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1599-1610, November.
  28. Rudolf Vetschera & Dmitriy Knyazev & Daniel Rehsmann, 2024. "Properties of bundle valuations in carrier collaboration," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(2), pages 241-266, June.
  29. Paul Dütting & Thomas Kesselheim & Éva Tardos, 2021. "Algorithms as Mechanisms: The Price of Anarchy of Relax and Round," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 317-335, February.
  30. Tim Roughgarden & Inbal Talgam-Cohen, 2018. "Approximately Optimal Mechanism Design," Papers 1812.11896, arXiv.org, revised Aug 2020.
  31. Sher, Itai & Kim, Kyoo il, 2014. "Identifying combinatorial valuations from aggregate demand," Journal of Economic Theory, Elsevier, vol. 153(C), pages 428-458.
  32. Satoko Moriguchi & Kazuo Murota & Akihisa Tamura & Fabio Tardella, 2020. "Discrete Midpoint Convexity," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 99-128, February.
  33. Thomas Kittsteiner & Marion Ott & Richard Steinberg, 2022. "Competing Combinatorial Auctions," Information Systems Research, INFORMS, vol. 33(4), pages 1130-1137, December.
  34. 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.
  35. 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.
  36. Ben Berger & Tomer Ezra & Michal Feldman & Federico Fusco, 2025. "Pandora’s Problem with Combinatorial Cost," Mathematics of Operations Research, INFORMS, vol. 50(4), pages 3161-3189, November.
  37. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  38. Suning Gong & Qingqin Nong & Wenjing Liu & Qizhi Fang, 2019. "Parametric monotone function maximization with matroid constraints," Journal of Global Optimization, Springer, vol. 75(3), pages 833-849, November.
  39. Alfredo Torrico & Alejandro Toriello, 2022. "Dynamic Relaxations for Online Bipartite Matching," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1871-1884, July.
  40. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
  41. Johannes Brustle & José Correa & Paul Dütting & Tomer Ezra & Michal Feldman & Victor Verdugo, 2026. "The Competition Complexity of Prophet Inequalities," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 641-665, January.
  42. Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
  43. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
  44. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
  45. 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.
  46. Babaioff, Moshe & Blumrosen, Liad & Roth, Aaron, 2015. "Auctions with online supply," Games and Economic Behavior, Elsevier, vol. 90(C), pages 227-246.
  47. Wellman Michael P & Osepayshvili Anna & MacKie-Mason Jeffrey K & Reeves Daniel, 2008. "Bidding Strategies for Simultaneous Ascending Auctions," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 8(1), pages 1-43, December.
  48. Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
  49. Martin Bichler & Paul Milgrom & Gregor Schwarz, 2023. "Taming the Communication and Computation Complexity of Combinatorial Auctions: The FUEL Bid Language," Management Science, INFORMS, vol. 69(4), pages 2217-2238, April.
  50. Yotam Gafni & Moshe Tennenholtz, 2022. "Optimal Mechanism Design for Agents with DSL Strategies: The Case of Sybil Attacks in Combinatorial Auctions," Papers 2210.15181, arXiv.org, revised Jul 2023.
  51. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
  52. Simon Bruggmann & Rico Zenklusen, 2019. "Submodular Maximization Through the Lens of Linear Programming," Management Science, INFORMS, vol. 44(4), pages 1221-1244, November.
  53. Zengfu Wang & Bill Moran & Xuezhi Wang & Quan Pan, 2015. "An accelerated continuous greedy algorithm for maximizing strong submodular functions," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1107-1124, November.
  54. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  55. Cheng Lu & Wenguo Yang, 2024. "Fast deterministic algorithms for non-submodular maximization with strong performance guarantees," Journal of Global Optimization, Springer, vol. 89(3), pages 777-801, July.
  56. Takanori Maehara & Kazuo Murota, 2015. "Valuated matroid-based algorithm for submodular welfare problem," Annals of Operations Research, Springer, vol. 229(1), pages 565-590, June.
  57. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
  58. Oren Ben-Zwi & Ilan Newman, 2023. "No Ascending Auction can find Equilibrium for SubModular valuations," Papers 2312.00522, arXiv.org.
  59. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
  60. Dash, Rajdeep K & Giovannucci, Andrea & Jennings, Nicholas R. & Mezzetti, Claudio & Ramchurn, Sarvapali D. & Rodriguez-Aguilar, Juan A., 2008. "Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty," The Warwick Economics Research Paper Series (TWERPS) 880, University of Warwick, Department of Economics.
  61. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
  62. Feldman, Michal & Fu, Hu & Gravin, Nick & Lucier, Brendan, 2020. "Simultaneous auctions without complements are (almost) efficient," Games and Economic Behavior, Elsevier, vol. 123(C), pages 327-341.
  63. Lavi, Ron & Nisan, Noam, 2015. "Online ascending auctions for gradually expiring items," Journal of Economic Theory, Elsevier, vol. 156(C), pages 45-76.
  64. Moshe Babaioff & Uriel Feige, 2019. "A New Approach to Fair Distribution of Welfare," Papers 1909.11346, arXiv.org.
  65. Martin Bichler & Stefan Waldherr, 2022. "Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions," Operations Research, INFORMS, vol. 70(1), pages 241-264, January.
  66. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
  67. Eric Budish & Judd B. Kessler, 2016. "Can Market Participants Report their Preferences Accurately (Enough)?," NBER Working Papers 22448, National Bureau of Economic Research, Inc.
  68. Sekar, Shreyas & Vojnovic, Milan & Yun, Se-Young, 2020. "A test score based approach to stochastic submodular optimization," LSE Research Online Documents on Economics 103176, London School of Economics and Political Science, LSE Library.
  69. Cheng Lu & Wenguo Yang, 2024. "Non-submodular maximization with a decomposable objective function," Journal of Combinatorial Optimization, Springer, vol. 48(5), pages 1-20, December.
  70. Xiaofei Liu & Weidong Li & Yaoyu Zhu, 2021. "Single Machine Vector Scheduling with General Penalties," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
  71. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
  72. Daniel Lehmann, 2019. "Revealed Preferences for Matching with Contracts," Papers 1908.08823, arXiv.org, revised Mar 2020.
  73. Shreyas Sekar & Milan Vojnovic & Se-Young Yun, 2021. "A Test Score-Based Approach to Stochastic Submodular Optimization," Management Science, INFORMS, vol. 67(2), pages 1075-1092, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.