IDEAS home Printed from https://ideas.repec.org/f/c/pni254.html
   My authors  Follow this author

Noam Nisan

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Yannai A. Gonczarowski & Lior Kovalio & Noam Nisan & Assaf Romm, 2019. "Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements," Papers 1905.00364, arXiv.org, revised Aug 2020.

    Cited by:

    1. Orhan Aygün & Bertan Turhan, 2023. "How to De-Reserve Reserves: Admissions to Technical Colleges in India," Management Science, INFORMS, vol. 69(10), pages 6147-6164, October.
    2. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202104130700001123, Iowa State University, Department of Economics.
    3. Reischmann, Tobias & Klein, Thilo & Giegerich, Sven, 2021. "An iterative deferred acceptance mechanism for decentralized, fast and fair childcare assignment," ZEW Discussion Papers 21-095, ZEW - Leibniz Centre for European Economic Research.
    4. Battal Doğan & Kemal Yildiz, 2023. "Choice with Affirmative Action," Management Science, INFORMS, vol. 69(4), pages 2284-2296, April.
    5. Tobias Reischmann & Thilo Klein & Sven Giegerich, 2021. "A deferred acceptance mechanism for decentralized, fast, and fair childcare assignment," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 6(1), pages 59-100, December.
    6. Haris Aziz & Florian Brandl, 2021. "Efficient, Fair, and Incentive-Compatible Healthcare Rationing," Papers 2102.04384, arXiv.org, revised Sep 2021.

  2. Sergiu Hart & Noam Nisan, 2014. "How Good Are Simple Mechanisms for Selling Multiple Goods?," Discussion Paper Series dp666, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    Cited by:

    1. Sergiu Hart & Philip J. Reny, 2012. "Maximal Revenue with Multiple Goods: Nonmonotonicity and Other Observations," Levine's Working Paper Archive 786969000000000625, David K. Levine.
    2. Ningyuan Chen & Adam N. Elmachtoub & Michael L. Hamilton & Xiao Lei, 2021. "Loot Box Pricing and Design," Management Science, INFORMS, vol. 67(8), pages 4809-4825, August.
    3. Domenico Menicucci & Sjaak Hurkens & Doh-Shin Jeon, 2014. "On the Optimality of Pure Bundling for a Monopolist," Working Papers 771, Barcelona School of Economics.
    4. Adam N. Elmachtoub & Michael L. Hamilton, 2021. "The Power of Opaque Products in Pricing," Management Science, INFORMS, vol. 67(8), pages 4686-4702, August.
    5. Mark Armstrong, 2016. "Nonlinear Pricing," Annual Review of Economics, Annual Reviews, vol. 8(1), pages 583-614, October.
    6. Ruben Hoeksma & Marc Uetz, 2016. "Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types," Operations Research, INFORMS, vol. 64(6), pages 1438-1450, December.
    7. Babaioff, Moshe & Gonczarowski, Yannai A. & Nisan, Noam, 2022. "The menu-size complexity of revenue approximation," Games and Economic Behavior, Elsevier, vol. 134(C), pages 281-307.

  3. Gali Noti & Noam Nisan & Ilan Yaniv, 2014. "An experimental evaluation of bidders' behavior in ad auctions," Discussion Paper Series dp676, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    Cited by:

    1. Bae, Jinsoo & Kagel, John H., 2019. "An experimental study of the generalized second price auction," International Journal of Industrial Organization, Elsevier, vol. 63(C), pages 44-68.

  4. Yannai A. Gonczarowski & Noam Nisan, 2014. "A Stable Marriage Requires Communication," Discussion Paper Series dp667, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    Cited by:

    1. Suat Evren, 2023. "Social Surplus Maximization in Sponsored Search Auctions Requires Communication," Papers 2305.07729, arXiv.org.
    2. Linda Cai & Clayton Thomas, 2019. "Representing All Stable Matchings by Walking a Maximal Chain," Papers 1910.04401, arXiv.org.
    3. Naveen Durvasula, 2022. "Utility-Based Communication Requirements for Stable Matching in Large Markets," Papers 2212.04024, arXiv.org.
    4. Tamás Fleiner & Zsuzsanna Jankó & Ildikó Schlotter & Alexander Teytelboym, 2023. "Complexity of stability in trading networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 629-648, September.
    5. Kenny Peng & Nikhil Garg, 2024. "Wisdom and Foolishness of Noisy Matching Markets," Papers 2402.16771, arXiv.org.

  5. Sergiu Hart & Noam Nisan, 2013. "The Query Complexity of Correlated Equilibria," Levine's Working Paper Archive 786969000000000819, David K. Levine.

    Cited by:

    1. Ayan Bhattacharya, 2019. "On Adaptive Heuristics that Converge to Correlated Equilibrium," Games, MDPI, vol. 10(1), pages 1-11, January.
    2. Bhaskar, Umang & Ligett, Katrina & Schulman, Leonard J. & Swamy, Chaitanya, 2019. "Achieving target equilibria in network routing games without knowing the latency functions," Games and Economic Behavior, Elsevier, vol. 118(C), pages 533-569.

  6. Sergiu Hart & Noam Nisan, 2013. "The Menu-Size Complexity of Auctions," Discussion Paper Series dp637, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    Cited by:

    1. Zhang, Hanzhe, 2019. "The Optimal Sequence of Prices and Auctions," Working Papers 2019-3, Michigan State University, Department of Economics.
    2. Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2024.
    3. Hartline, Jason D. & Kleinberg, Robert & Malekian, Azarakhsh, 2015. "Bayesian incentive compatibility via matchings," Games and Economic Behavior, Elsevier, vol. 92(C), pages 401-429.
    4. Alon Eden & Michal Feldman & Ophir Friedler & Inbal Talgam-Cohen & S. Matthew Weinberg, 2021. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements," Operations Research, INFORMS, vol. 69(1), pages 188-206, January.
    5. Banghua Zhu & Stephen Bates & Zhuoran Yang & Yixin Wang & Jiantao Jiao & Michael I. Jordan, 2022. "The Sample Complexity of Online Contract Design," Papers 2211.05732, arXiv.org, revised May 2023.
    6. Chen, Xi & Diakonikolas, Ilias & Paparas, Dimitris & Sun, Xiaorui & Yannakakis, Mihalis, 2018. "The complexity of optimal multidimensional pricing for a unit-demand buyer," Games and Economic Behavior, Elsevier, vol. 110(C), pages 139-164.
    7. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    8. Tang, Pingzhong & Wang, Zihe, 2017. "Optimal mechanisms with simple menus," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 54-70.
    9. Gagan Aggarwal & Kshipra Bhawalkar & Guru Guruganesh & Andres Perlroth, 2021. "Maximizing revenue in the presence of intermediaries," Papers 2111.10472, arXiv.org.
    10. Devanur, Nikhil R. & Haghpanah, Nima & Psomas, Alexandros, 2020. "Optimal multi-unit mechanisms with private demands," Games and Economic Behavior, Elsevier, vol. 121(C), pages 482-505.
    11. Tomer Siedner, 2019. "Optimal pricing by a risk-averse seller," Discussion Paper Series dp725, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    12. Sergiu Hart & Philip J. Reny, 2017. "The Better Half of Selling Separately," Discussion Paper Series dp712, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    13. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.
    14. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage," Working Papers e116, Tokyo Center for Economic Research.
    15. Babaioff, Moshe & Gonczarowski, Yannai A. & Nisan, Noam, 2022. "The menu-size complexity of revenue approximation," Games and Economic Behavior, Elsevier, vol. 134(C), pages 281-307.
    16. Azar, Pablo D. & Kleinberg, Robert & Weinberg, S. Matthew, 2019. "Prior independent mechanisms via prophet inequalities with limited information," Games and Economic Behavior, Elsevier, vol. 118(C), pages 511-532.

  7. Sergiu Hart & Noam Nisan, 2012. "Approximate Revenue Maximization with Multiple Items," Discussion Paper Series dp606, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    Cited by:

    1. Yannai A. Gonczarowski & Nicole Immorlica & Yingkai Li & Brendan Lucier, 2021. "Revenue Maximization for Buyers with Costly Participation," Papers 2103.03980, arXiv.org, revised Nov 2023.
    2. Dirk Bergemann & Alessandro Bonatti & Andreas Haupt & Alex Smolin, 2021. "The Optimality of Upgrade Pricing," Cowles Foundation Discussion Papers 2290, Cowles Foundation for Research in Economics, Yale University.
    3. Baisa, Brian, 2017. "Auction design without quasilinear preferences," Theoretical Economics, Econometric Society, vol. 12(1), January.
    4. Fabian R. Pieroth & Tuomas Sandholm, 2024. "Verifying Approximate Equilibrium in Auctions," Papers 2408.11445, arXiv.org.
    5. Sergiu Hart & Philip J. Reny, 2012. "Maximal Revenue with Multiple Goods: Nonmonotonicity and Other Observations," Levine's Working Paper Archive 786969000000000625, David K. Levine.
    6. Negin Golrezaei & Hamid Nazerzadeh & Ramandeep Randhawa, 2020. "Dynamic Pricing for Heterogeneous Time-Sensitive Customers," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 562-581, May.
    7. Moshe Babaioff & Michal Feldman & Yannai A. Gonczarowski & Brendan Lucier & Inbal Talgam-Cohen, 2020. "Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer," Papers 2003.05913, arXiv.org, revised Aug 2020.
    8. Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2024.
    9. Sushil Bikhchandani & Debasis Mishra, 2020. "Selling Two Identical Objects," Papers 2009.11545, arXiv.org, revised Aug 2021.
    10. Alon Eden & Michal Feldman & Ophir Friedler & Inbal Talgam-Cohen & S. Matthew Weinberg, 2021. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements," Operations Research, INFORMS, vol. 69(1), pages 188-206, January.
    11. Yuan Deng & Jieming Mao & Balasubramanian Sivan & Kangning Wang, 2021. "Optimal Pricing Schemes for an Impatient Buyer," Papers 2106.02149, arXiv.org, revised Feb 2023.
    12. Hanzhao Wang & Xiaocheng Li & Kalyan Talluri, 2022. "Learning to Sell a Focal-ancillary Combination," Papers 2207.11545, arXiv.org.
    13. Mira Frick & Ryota Iijima & Yuhta Ishii, 2024. "Multidimensional Screening with Rich Consumer Data," Papers 2411.06312, arXiv.org.
    14. Frank Yang, 2021. "Costly Multidimensional Screening," Papers 2109.00487, arXiv.org, revised Aug 2022.
    15. Isa Hafalir & Antonio Miralles, "undated". "Welfare-Maximizing Assignment of Agents to Hierarchical Positions," GSIA Working Papers 2015-E6, Carnegie Mellon University, Tepper School of Business.
    16. Moshe Babaioff & Linda Cai & Brendan Lucier, 2024. "Bundling in Oligopoly: Revenue Maximization with Single-Item Competitors," Papers 2406.13835, arXiv.org.
    17. Debasis Mishra & Kolagani Paramahamsa, 2018. "Selling to a naive agent with two rationales," Discussion Papers 18-03, Indian Statistical Institute, Delhi.
    18. Chen, Xi & Diakonikolas, Ilias & Paparas, Dimitris & Sun, Xiaorui & Yannakakis, Mihalis, 2018. "The complexity of optimal multidimensional pricing for a unit-demand buyer," Games and Economic Behavior, Elsevier, vol. 110(C), pages 139-164.
    19. Rangeet Bhattacharyya & Parvik Dave & Palash Dey & Swaprava Nath, 2022. "Optimal Referral Auction Design," Papers 2208.09326, arXiv.org, revised Jul 2023.
    20. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    21. Santiago R. Balseiro & Vahab S. Mirrokni & Renato Paes Leme, 2018. "Dynamic Mechanisms with Martingale Utilities," Management Science, INFORMS, vol. 64(11), pages 5062-5082, November.
    22. Jamie Tucker-Foltz & Richard Zeckhauser, 2022. "Playing Divide-and-Choose Given Uncertain Preferences," Papers 2207.03076, arXiv.org, revised Oct 2024.
    23. Mishra, Debasis & Pramanik, Anup & Roy, Souvik, 2014. "Multidimensional mechanism design in single peaked type spaces," Journal of Economic Theory, Elsevier, vol. 153(C), pages 103-116.
    24. Briest, Patrick & Chawla, Shuchi & Kleinberg, Robert & Weinberg, S. Matthew, 2015. "Pricing lotteries," Journal of Economic Theory, Elsevier, vol. 156(C), pages 144-174.
    25. Jing Chen & Silvio Micali, 2016. "Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions," Games, MDPI, vol. 7(4), pages 1-19, October.
    26. Hart, Sergiu & Nisan, Noam, 2019. "Selling multiple correlated goods: Revenue maximization and menu-size complexity," Journal of Economic Theory, Elsevier, vol. 183(C), pages 991-1029.
    27. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    28. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Discussion Papers 22-02, Indian Statistical Institute, Delhi.
    29. Tang, Pingzhong & Wang, Zihe, 2017. "Optimal mechanisms with simple menus," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 54-70.
    30. Seung Han Yoo, 2018. "Membership Mechanisms," Discussion Paper Series 1804, Institute of Economic Research, Korea University.
    31. Devansh Jalota & Michael Ostrovsky & Marco Pavone, 2024. "When Simple is Near Optimal in Security Games," Papers 2402.11209, arXiv.org, revised Aug 2024.
    32. Gagan Aggarwal & Kshipra Bhawalkar & Guru Guruganesh & Andres Perlroth, 2021. "Maximizing revenue in the presence of intermediaries," Papers 2111.10472, arXiv.org.
    33. Dirk Bergemann & Yang Cai & Grigoris Velegkas & Mingfei Zhao, 2022. "Is Selling Complete Information (Approximately) Optimal?," Cowles Foundation Discussion Papers 2324, Cowles Foundation for Research in Economics, Yale University.
    34. Shixin Wang, 2024. "Semi-Separable Mechanisms in Multi-Item Robust Screening," Papers 2408.13580, arXiv.org.
    35. Jin Xi & Haitian Xie, 2021. "Strength in Numbers: Robust Mechanisms for Public Goods with Many Agents," Papers 2101.02423, arXiv.org, revised May 2023.
    36. Devanur, Nikhil R. & Haghpanah, Nima & Psomas, Alexandros, 2020. "Optimal multi-unit mechanisms with private demands," Games and Economic Behavior, Elsevier, vol. 121(C), pages 482-505.
    37. Tomer Siedner, 2019. "Optimal pricing by a risk-averse seller," Discussion Paper Series dp725, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    38. Hummel, Patrick, 2017. "Endogenous budget constraints," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 11-15.
    39. Sergiu Hart & Philip J. Reny, 2017. "The Better Half of Selling Separately," Discussion Paper Series dp712, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    40. Tim Roughgarden & Inbal Talgam-Cohen, 2018. "Approximately Optimal Mechanism Design," Papers 1812.11896, arXiv.org, revised Aug 2020.
    41. Sergiu Hart & Noam Nisan, 2013. "Selling Multiple Correlated Goods: Revenue Maximization and Menu-Size Complexity (old title: "The Menu-Size Complexity of Auctions")," Papers 1304.6116, arXiv.org, revised Nov 2018.
    42. Babaioff, Moshe & Gonczarowski, Yannai A. & Nisan, Noam, 2022. "The menu-size complexity of revenue approximation," Games and Economic Behavior, Elsevier, vol. 134(C), pages 281-307.
    43. Nicolò, Antonio & Sen, Arunava & Yadav, Sonal, 2019. "Matching with partners and projects," Journal of Economic Theory, Elsevier, vol. 184(C).
    44. Ran Ben-Moshe & Sergiu Hart & Noam Nisan, 2022. "Monotonic Mechanisms for Selling Multiple Goods," Papers 2210.17150, arXiv.org, revised Jun 2024.
    45. Axel Niemeyer & Justus Preusser, 2024. "Optimal Allocation with Peer Information," Papers 2410.08954, arXiv.org.
    46. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Papers 2202.10378, arXiv.org, revised Oct 2024.
    47. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    48. Chawla, Shuchi & Teng, Yifeng & Tzamos, Christos, 2022. "Buy-many mechanisms are not much better than item pricing," Games and Economic Behavior, Elsevier, vol. 134(C), pages 104-116.

  8. Ehud Friedgut & Gil Kalai & Noam Nisan, 2008. "Elections Can be Manipulated Often," Levine's Working Paper Archive 122247000000002416, David K. Levine.

    Cited by:

    1. Marie-Louise Lackner & Martin Lackner, 2017. "On the likelihood of single-peaked preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(4), pages 717-745, April.

  9. 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.

    Cited by:

    1. Müller, R.J. & Perea ý Monsuwé, A. & Wolf, S., 2007. "Combinatorial scoring auctions," Research Memorandum 020, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.

  10. 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.

    Cited by:

    1. Kagel, John H. & Lien, Yuanchuan & Milgrom, Paul, 2014. "Ascending prices and package bidding: Further experimental analysis," Games and Economic Behavior, Elsevier, vol. 85(C), pages 210-231.
    2. 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.
    3. 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.
    4. 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.
    5. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
    6. John H. Kagel & Yuanchuan Lien & Paul Milgrom, 2010. "Ascending Prices and Package Bidding: A Theoretical and Experimental Analysis," American Economic Journal: Microeconomics, American Economic Association, vol. 2(3), pages 160-185, August.

  11. 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.

    Cited by:

    1. 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.
    2. Kagel, John H. & Lien, Yuanchuan & Milgrom, Paul, 2014. "Ascending prices and package bidding: Further experimental analysis," Games and Economic Behavior, Elsevier, vol. 85(C), pages 210-231.
    3. 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.
    4. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
    5. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.

Articles

  1. Hart, Sergiu & Nisan, Noam, 2019. "Selling multiple correlated goods: Revenue maximization and menu-size complexity," Journal of Economic Theory, Elsevier, vol. 183(C), pages 991-1029.

    Cited by:

    1. Moshe Babaioff & Michal Feldman & Yannai A. Gonczarowski & Brendan Lucier & Inbal Talgam-Cohen, 2020. "Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer," Papers 2003.05913, arXiv.org, revised Aug 2020.
    2. Sushil Bikhchandani & Debasis Mishra, 2020. "Selling Two Identical Objects," Papers 2009.11545, arXiv.org, revised Aug 2021.
    3. Rahul Deb & Anne-Katrin Roesler, 2021. "Multi-Dimensional Screening: Buyer-Optimal Learning and Informational Robustness," Papers 2105.12304, arXiv.org.
    4. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    5. Jamie Tucker-Foltz & Richard Zeckhauser, 2022. "Playing Divide-and-Choose Given Uncertain Preferences," Papers 2207.03076, arXiv.org, revised Oct 2024.
    6. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    7. Shixin Wang, 2023. "The Power of Simple Menus in Robust Selling Mechanisms," Papers 2310.17392, arXiv.org, revised Sep 2024.
    8. Dirk Bergemann & Yang Cai & Grigoris Velegkas & Mingfei Zhao, 2022. "Is Selling Complete Information (Approximately) Optimal?," Cowles Foundation Discussion Papers 2324, Cowles Foundation for Research in Economics, Yale University.
    9. Zhang, Xinhua & Hueng, C. James & Lemke, Robert J., 2023. "A self-selection pricing mechanism for residential electricity: Measures of sustainability and equity to balance market mechanisms and government controls," Journal of Policy Modeling, Elsevier, vol. 45(6), pages 1167-1183.
    10. Michael Curry & Tuomas Sandholm & John Dickerson, 2022. "Differentiable Economics for Randomized Affine Maximizer Auctions," Papers 2202.02872, arXiv.org.
    11. Schäfers, Sebastian, 2022. "Product Lotteries and Loss Aversion," Working papers 2022/06, Faculty of Business and Economics - University of Basel.
    12. Ran Ben-Moshe & Sergiu Hart & Noam Nisan, 2022. "Monotonic Mechanisms for Selling Multiple Goods," Papers 2210.17150, arXiv.org, revised Jun 2024.
    13. Tal Alon & Paul Dutting & Yingkai Li & Inbal Talgam-Cohen, 2022. "Bayesian Analysis of Linear Contracts," Papers 2211.06850, arXiv.org, revised Jul 2023.
    14. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    15. Chawla, Shuchi & Teng, Yifeng & Tzamos, Christos, 2022. "Buy-many mechanisms are not much better than item pricing," Games and Economic Behavior, Elsevier, vol. 134(C), pages 104-116.

  2. Gonczarowski, Yannai A. & Nisan, Noam & Ostrovsky, Rafail & Rosenbaum, Will, 2019. "A stable marriage requires communication," Games and Economic Behavior, Elsevier, vol. 118(C), pages 626-647.
    See citations under working paper version above.
  3. Hart, Sergiu & Nisan, Noam, 2018. "The query complexity of correlated equilibria," Games and Economic Behavior, Elsevier, vol. 108(C), pages 401-410.
    See citations under working paper version above.
  4. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    See citations under working paper version above.
  5. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.

    Cited by:

    1. Blume, Lawrence & Easley, David & Kleinberg, Jon & Kleinberg, Robert & Tardos, Éva, 2015. "Introduction to computer science and economic theory," Journal of Economic Theory, Elsevier, vol. 156(C), pages 1-13.
    2. Carbajal, Juan Carlos & Müller, Rudolf, 2017. "Monotonicity and revenue equivalence domains by monotonic transformations in differences," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 29-35.
    3. Satoshi Takahashi & Yoichi Izunaga & Naoki Watanabe, 2018. "An approximation algorithm for multi-unit auctions: numerical and subject experiments," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 28(1), pages 95-115.
    4. Leucci, Stefano & Mamageishvili, Akaki & Penna, Paolo, 2018. "No truthful mechanism can be better than n approximate for two natural problems," Games and Economic Behavior, Elsevier, vol. 111(C), pages 64-74.

  6. Lavi, Ron & Nisan, Noam, 2015. "Online ascending auctions for gradually expiring items," Journal of Economic Theory, Elsevier, vol. 156(C), pages 45-76.

    Cited by:

    1. Sambuddha Ghosh & Yan Long & Manipushpak Mitra, 2021. "Prior-free online mechanisms for queueing with arrivals," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(2), pages 671-700, September.
    2. Blume, Lawrence & Easley, David & Kleinberg, Jon & Kleinberg, Robert & Tardos, Éva, 2015. "Introduction to computer science and economic theory," Journal of Economic Theory, Elsevier, vol. 156(C), pages 1-13.

  7. Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.

    Cited by:

    1. Crescenzio Gallo & Giancarlo De Stasio & Cristina Di Letizia, 2006. "A Data Set Generation Algorithm in Combinatorial Auctions," Quaderni DSEMS 01-2006, Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia.
    2. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 12acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    3. Balmaceda, Felipe, 2018. "Optimal task assignments with loss-averse agents," European Economic Review, Elsevier, vol. 105(C), pages 1-26.
    4. Balmaceda, Felipe, 2016. "Optimal task assignments," Games and Economic Behavior, Elsevier, vol. 98(C), pages 1-18.
    5. 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.
    6. Guru Guruganesh & Yoav Kolumbus & Jon Schneider & Inbal Talgam-Cohen & Emmanouil-Vasileios Vlatakis-Gkaragkounis & Joshua R. Wang & S. Matthew Weinberg, 2024. "Contracting with a Learning Agent," Papers 2401.16198, arXiv.org.
    7. Paul Milgrom, 2003. "Matching with Contracts," Working Papers 03003, Stanford University, Department of Economics.
    8. 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.
    9. Block, C. & Collins, J. & Ketter, W. & Weinhardt, C., 2009. "A Multi-Agent Energy Trading Competition," ERIM Report Series Research in Management ERS-2009-054-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. Yurong Chen & Zhaohua Chen & Xiaotie Deng & Zhiyi Huang, 2024. "Are Bounded Contracts Learnable and Approximately Optimal?," Papers 2402.14486, arXiv.org.
    11. Lunander, Anders & Lundberg, Sofia, 2009. "Do Combinatorial Procurement Auctions Lower Cost? - An Empirical Analysis of Public Procurement of Multiple Contracts," Umeå Economic Studies 776, Umeå University, Department of Economics, revised 16 Sep 2009.
    12. Regan, A C & Song, Jiongjiong, 2003. "Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective," University of California Transportation Center, Working Papers qt7sq003mj, University of California Transportation Center.
    13. 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.
    14. 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.
    15. 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).
    16. Lawrence M. Ausubel & Peter Cramton & Wynne P. Jones, 2012. "System and Method for an Auction of Multiple Types of Items," Papers of Peter Cramton 11acjam, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    17. Müller, R.J. & Perea ý Monsuwé, A. & Wolf, S., 2007. "Combinatorial scoring auctions," Research Memorandum 020, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    18. Yigal Gerchak & Christian Schmid, 2022. "Principal–agent models where a principal is only affected by extreme performances," Managerial and Decision Economics, John Wiley & Sons, Ltd., vol. 43(2), pages 468-477, March.
    19. Lawrence M. Ausubel & Paul Milgrom, 2005. "Ascending Proxy Auctions," Levine's Bibliography 122247000000000785, UCLA Department of Economics.
    20. Rica Gonen & Anat Lerner, 2013. "The Incompatibility of Pareto Optimality and Dominant-Strategy Incentive Compatibility in Sufficiently-Anonymous Budget-Constrained Quasilinear Settings," Games, MDPI, vol. 4(4), pages 1-21, November.
    21. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    22. Ariane Lambert-Mogiliansky & Konstantin Sonin, 2005. "Collusive market-sharing and corruption in procurement," Working Papers halshs-00590773, HAL.
    23. Mark Bykowsky & Jonathan Levy & William Sharkey & Tracy Waldon & Simon Wilkie, 2003. "Economic Analysis at the Federal Communications Commission," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 23(2), pages 157-174, September.
    24. , & ,, 2013. "Implementation in multidimensional dichotomous domains," Theoretical Economics, Econometric Society, vol. 8(2), May.
    25. Ilan Nehama, 2013. "Complexity of Optimal Lobbying in Threshold Aggregation," Discussion Paper Series dp642, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    26. Johannes C. Müller & Sebastian Pokutta & Alexander Martin & Susanne Pape & Andrea Peter & Thomas Winter, 2017. "Pricing and clearing combinatorial markets with singleton and swap orders," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(2), pages 155-177, April.
    27. 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.
    28. Nora, Vladyslav & Winter, Eyal, 2024. "Exploiting social influence in networks," Theoretical Economics, Econometric Society, vol. 19(1), January.
    29. 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.
    30. Müller, R.J., 2001. "Auctions : the big winner among trading mechanisms for the Internet economy," Research Memorandum 016, Maastricht University, Maastricht Economic Research Institute on Innovation and Technology (MERIT).
    31. Paul Milgrom, 2008. "Assignment Messages and Exchanges," Discussion Papers 08-014, Stanford Institute for Economic Policy Research.
    32. Ron Lavi & Ahuva Mu’alem & Noam Nisan, 2009. "Two simplified proofs for Roberts’ theorem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(3), pages 407-423, March.
    33. Song, Jiongjiong & Regan, Amelia C. & Nandiraju, Srinivas, 2008. "A Bid Analysis Model with Business Constraints for Transportation Procurement Auctions," University of California Transportation Center, Working Papers qt24817929, University of California Transportation Center.
    34. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Levine's Bibliography 843644000000000184, UCLA Department of Economics.
    35. Balmaceda, Felipe & Balseiro, Santiago R. & Correa, José R. & Stier-Moses, Nicolás E., 2016. "Bounds on the welfare loss from moral hazard with limited liability," Games and Economic Behavior, Elsevier, vol. 95(C), pages 137-155.
    36. Song, Jiongjiong & Regan, Amelia C & Nandiraju, Srinivas, 2008. "A Bid Analysis Model with Business Constraints for Transportation Procurement Auctions," University of California Transportation Center, Working Papers qt5766c7r1, University of California Transportation Center.
    37. Martin Bichler & Alexander Pikovsky & Thomas Setzer, 2009. "An Analysis of Design Problems in Combinatorial Procurement Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(1), pages 111-117, February.
    38. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
    39. Jawad Abrache & Teodor Gabriel Crainic & Michel Gendreau, 2002. "Models for Bundle Trading in Financial Markets," CIRANO Working Papers 2002s-84, CIRANO.
    40. Song, Jiongjiong & Regan, A C, 2003. "Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts," University of California Transportation Center, Working Papers qt3j7034z2, University of California Transportation Center.
    41. Blumrosen, Liad & Feldman, Michal, 2013. "Mechanism design with a restricted action space," Games and Economic Behavior, Elsevier, vol. 82(C), pages 424-443.
    42. Ariane Lambert-Mogiliansky & Konstantin Sonin, 2003. "Corruption and Collusion in Procurement Tenders," Working Papers w0036, Center for Economic and Financial Research (CEFIR).
    43. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Discussion Paper Series dp452, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

  8. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.

    Cited by:

    1. Paul Dütting & Felix Fischer & David C. Parkes, 2019. "Expressiveness and Robustness of First-Price Position Auctions," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 196-211, February.
    2. Condorelli, Daniele, 2013. "Market and non-market mechanisms for the optimal allocation of scarce resources," Games and Economic Behavior, Elsevier, vol. 82(C), pages 582-591.
    3. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    4. Boulatov, Alexei & Severinov, Sergei, 2021. "Optimal and efficient mechanisms with asymmetrically budget constrained buyers," Games and Economic Behavior, Elsevier, vol. 127(C), pages 155-178.
    5. Anne-Christine Barthel & Tarun Sabarwal, 2018. "Directional monotone comparative statics," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 66(3), pages 557-591, October.
    6. Baisa, Brian, 2017. "Auction design without quasilinear preferences," Theoretical Economics, Econometric Society, vol. 12(1), January.
    7. Mueller-Frank, Manuel & M. Pai, Mallesh, 2015. "Do Online Social Networks Increase Welfare?," IESE Research Papers D/1118, IESE Business School.
    8. Bobkova, Nina, 2020. "Asymmetric budget constraints in a first-price auction," Journal of Economic Theory, Elsevier, vol. 186(C).
    9. Baisa, Brian, 2016. "Overbidding and inefficiencies in multi-unit Vickrey auctions for normal goods," Games and Economic Behavior, Elsevier, vol. 99(C), pages 23-35.
    10. Dütting, Paul & Fischer, Felix & Parkes, David C., 2019. "Expressiveness and robustness of first-price position auctions," LSE Research Online Documents on Economics 85877, London School of Economics and Political Science, LSE Library.
    11. L. Elisa Celis & Gregory Lewis & Markus Mobius & Hamid Nazerzadeh, 2014. "Buy-It-Now or Take-a-Chance: Price Discrimination Through Randomized Auctions," Management Science, INFORMS, vol. 60(12), pages 2927-2948, December.
    12. Kotowski, Maciej H., 2020. "First-price auctions with budget constraints," Theoretical Economics, Econometric Society, vol. 15(1), January.
    13. Yuya Wakabayashi & Ryosuke Sakai & Hiroki Shinozaki, 2024. "Strategy-proof allocation problem with hard budget constraints and income effects: weak efficiency and fairness," OSIPP Discussion Paper 24E003, Osaka School of International Public Policy, Osaka University.
    14. Jianxin Rong & Ning Sun & Dazhong Wang, 2019. "A New Evaluation Criterion for Allocation Mechanisms with Application to Vehicle License Allocations in China," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 4(1), pages 39-86, November.
    15. Bichler, Martin & Merting, Sören, 2018. "Truthfulness in advertising? Approximation mechanisms for knapsack bidders," European Journal of Operational Research, Elsevier, vol. 270(2), pages 775-783.
    16. Alireza Fallah & Michael I. Jordan & Annie Ulichney, 2024. "Fair Allocation in Dynamic Mechanism Design," Papers 2406.00147, arXiv.org, revised Oct 2024.
    17. SHINOZAKI, Hiroki, 2024. "Shill-proof rules in object allocation problems with money," Discussion paper series HIAS-E-137, Hitotsubashi Institute for Advanced Study, Hitotsubashi University.
    18. Rica Gonen & Anat Lerner, 2013. "The Incompatibility of Pareto Optimality and Dominant-Strategy Incentive Compatibility in Sufficiently-Anonymous Budget-Constrained Quasilinear Settings," Games, MDPI, vol. 4(4), pages 1-21, November.
    19. Jianxin Yi, 2024. "A note on the impossibility of multi-unit auctions with budget-constrained bidders," Review of Economic Design, Springer;Society for Economic Design, vol. 28(2), pages 331-345, June.
    20. SHINOZAKI, Hiroki, 2023. "Non-obvious manipulability and efficiency in package assignment problems with money for agents with income effects and hard budget constraints," Discussion paper series HIAS-E-136, Hitotsubashi Institute for Advanced Study, Hitotsubashi University.
    21. Ghosh, Gagan & Liu, Heng, 2019. "Sequential second-price auctions with private budgets," Games and Economic Behavior, Elsevier, vol. 113(C), pages 611-632.
    22. Andrea Canidio & Felix Henneke, 2024. "Fair Combinatorial Auction for Blockchain Trade Intents: Being Fair without Knowing What is Fair," Papers 2408.12225, arXiv.org, revised Dec 2024.
    23. P. Jean‐Jacques Herings & Yu Zhou, 2022. "Competitive Equilibria In Matching Models With Financial Constraints," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 63(2), pages 777-802, May.
    24. Piotr Dworczak & Scott Duke Kominers & Mohammad Akbarpour, 2021. "Redistribution Through Markets," Econometrica, Econometric Society, vol. 89(4), pages 1665-1698, July.
    25. Fadaei, Salman & Bichler, Martin, 2017. "Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets," European Journal of Operational Research, Elsevier, vol. 260(2), pages 767-777.
    26. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Mechanism design without quasilinearity," Discussion Papers 17-04, Indian Statistical Institute, Delhi.
    27. Labrini Zarpala, 2023. "Auctioning Corporate Bonds: A Uniform-Price under Investment Mandates," Papers 2306.07134, arXiv.org.
    28. Ulrich Bergmann & Arkady Konovalov, 2024. "Auction design and order of sale with budget-constrained bidders," Experimental Economics, Springer;Economic Science Association, vol. 27(1), pages 36-57, March.
    29. Hafalir, Isa E. & Ravi, R. & Sayedi, Amin, 2012. "A near Pareto optimal auction with budget constraints," Games and Economic Behavior, Elsevier, vol. 74(2), pages 699-708.
    30. Lavi, Ron & May, Marina, 2012. "A note on the incompatibility of strategy-proofness and Pareto-optimality in quasi-linear settings with public budgets," Economics Letters, Elsevier, vol. 115(1), pages 100-103.
    31. Jinsoo Bae & John H. Kagel, 2022. "Selling shares to budget-constrained bidders: an experimental study of the proportional auction," Journal of the Economic Science Association, Springer;Economic Science Association, vol. 8(1), pages 45-55, December.
    32. Hummel, Patrick, 2017. "Endogenous budget constraints," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 11-15.
    33. Komal Malik & Debasis Mishra, 2018. "Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity," Discussion Papers 18-06, Indian Statistical Institute, Delhi.
    34. Carbajal, Juan Carlos & Mu'alem, Ahuva, 2020. "Selling mechanisms for a financially constrained buyer," Games and Economic Behavior, Elsevier, vol. 124(C), pages 386-405.
    35. Baisa, Brian, 2020. "Efficient multi-unit auctions for normal goods," Theoretical Economics, Econometric Society, vol. 15(1), January.
    36. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.
    37. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage," Working Papers e116, Tokyo Center for Economic Research.
    38. Maarten Janssen & Vladimir Karamychev, 2013. "Gaming in Combinatorial Clock Auctions," Tinbergen Institute Discussion Papers 13-027/VII, Tinbergen Institute, revised 16 Dec 2013.
    39. Yi, Jianxin & Li, Yong, 2016. "A general impossibility theorem and its application to individual rights," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 79-86.
    40. Malik, Komal & Mishra, Debasis, 2021. "Pareto efficient combinatorial auctions: Dichotomous preferences without quasilinearity," Journal of Economic Theory, Elsevier, vol. 191(C).
    41. Phuong Le, 2017. "Mechanisms for combinatorial auctions with budget constraints," Review of Economic Design, Springer;Society for Economic Design, vol. 21(1), pages 1-31, March.
    42. Arash Asadpour & MohammadHossein Bateni & Kshipra Bhawalkar & Vahab Mirrokni, 2019. "Concise Bid Optimization Strategies with Multiple Budget Constraints," Management Science, INFORMS, vol. 65(12), pages 5785-5812, December.
    43. Patrick Maillé & Bruno Tuffin, 2018. "Auctions for online ad space among advertisers sensitive to both views and clicks," Electronic Commerce Research, Springer, vol. 18(3), pages 485-506, September.
    44. Goel, Gagan & Mirrokni, Vahab & Paes Leme, Renato, 2020. "Clinching auctions with online supply," Games and Economic Behavior, Elsevier, vol. 123(C), pages 342-358.
    45. Mohammad Zia & Ram C. Rao, 2019. "Search Advertising: Budget Allocation Across Search Engines," Marketing Science, INFORMS, vol. 38(6), pages 1023-1037, November.
    46. Yi, Jianxin & Wang, Hefei & Li, Yong, 2018. "Designing efficient and incentive compatible mechanisms is almost impossible in quasi-linear environments," Economics Letters, Elsevier, vol. 173(C), pages 113-117.

  9. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.

    Cited by:

    1. 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.
    2. Oren Ben-Zwi & Ilan Newman, 2023. "No Ascending Auction can find Equilibrium for SubModular valuations," Papers 2312.00522, arXiv.org.
    3. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
    4. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.
    5. Perennes, Patricia, 2014. "Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 175-187.
    6. Dughmi, Shaddin & Vondrák, Jan, 2015. "Limitations of randomized mechanisms for combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 92(C), pages 370-400.
    7. Paul Dütting & Vasilis Gkatzelis & Tim Roughgarden, 2017. "The Performance of Deferred-Acceptance Auctions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 897-914, November.

  10. Ron Lavi & Ahuva Mu’alem & Noam Nisan, 2009. "Two simplified proofs for Roberts’ theorem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(3), pages 407-423, March.

    Cited by:

    1. Katherine Cuff & Sunghoon Hong & Jesse Schwartz & Quan Wen & John Weymark, 2012. "Dominant strategy implementation with a convex product space of valuations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 567-597, July.
    2. Debasis Mishra & Arunava Sen, 2010. "Roberts' theorem with neutrality: A Social welfare ordering approach," Discussion Papers 10-03, Indian Statistical Institute, Delhi.
    3. Juan Carlos Carbajal & Andrew McLennan & Rabee Tourky, 2012. "Truthful Implementation and Preference Aggregation in Restricted Domains," Discussion Papers Series 459, School of Economics, University of Queensland, Australia.
    4. Mishra, Debasis & Nath, Swaprava & Roy, Souvik, 2018. "Separability and decomposition in mechanism design with transfers," Games and Economic Behavior, Elsevier, vol. 109(C), pages 240-261.
    5. Hammond, Peter J., 2020. "Roberts' Weak Welfarism Theorem: A Minor Correction," The Warwick Economics Research Paper Series (TWERPS) 1308, University of Warwick, Department of Economics.
    6. Campbell, Donald E. & Kelly, Jerry S., 2010. "Strategy-proofness and weighted voting," Mathematical Social Sciences, Elsevier, vol. 60(1), pages 15-23, July.
    7. Kumar, Ujjwal & Roy, Souvik, 2021. "Local incentive compatibility in ordinal type-spaces," MPRA Paper 110994, University Library of Munich, Germany.
    8. Philippe Jehiel & Moritz Meyer-Ter-Vehn & Benny Moldovanu, 2008. "Ex-post implementation and preference aggregation via potentials," Post-Print halshs-00754256, HAL.
    9. Thierry Marchant & Debasis Mishra, 2015. "Mechanism design with two alternatives in quasi-linear environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 433-455, February.
    10. Jacob K. Goeree & Alexey Kushnir, 2011. "On the equivalence of Bayesian and dominant strategy implementation in a general class of social choice problems," ECON - Working Papers 021, Department of Economics - University of Zurich.
    11. Ryoto Ando & Kei Kimura & Taiki Todo & Makoto Yokoo, 2024. "Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs," Papers 2411.05574, arXiv.org, revised Nov 2024.
    12. Paul H. Edelman & John A. Weymark, 2021. "Dominant strategy implementability and zero length cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(4), pages 1091-1120, November.
    13. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.

  11. Babaioff, Moshe & Nisan, Noam & Pavlov, Elan, 2009. "Mechanisms for a spatially distributed market," Games and Economic Behavior, Elsevier, vol. 66(2), pages 660-684, July.

    Cited by:

    1. Xiao, Haohan & Xu, Meng & Gao, Ziyou, 2018. "Shared parking problem: A novel truthful double auction mechanism approach," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 40-69.
    2. Benjamin Heymann & Alejandro Jofré, 2024. "Reverse auctions with transportation and convex costs," Computational Management Science, Springer, vol. 21(1), pages 1-18, June.
    3. Bin Li & Dong Hao & Dengji Zhao & Tao Zhou, 2018. "Customer Sharing in Economic Networks with Costs," Papers 1807.06822, arXiv.org.
    4. 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.
    5. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," Games and Economic Behavior, Elsevier, vol. 105(C), pages 59-83.
    6. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," LSE Research Online Documents on Economics 83199, London School of Economics and Political Science, LSE Library.
    7. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    8. John Birge & Ozan Candogan & Hongfan Chen & Daniela Saban, 2021. "Optimal Commissions and Subscriptions in Networked Markets," Manufacturing & Service Operations Management, INFORMS, vol. 23(3), pages 569-588, May.
    9. Moshe Babaioff & Kira Goldner & Yannai A. Gonczarowski, 2019. "Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets," Papers 1903.06696, arXiv.org, revised Dec 2019.

  12. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.

    Cited by:

    1. Martin Bichler & Zhen Hao & Richard Littmann & Stefan Waldherr, 2020. "Strategyproof auction mechanisms for network procurement," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 965-994, December.
    2. Deshi Ye & Feng Xie & Guochuan Zhang, 2022. "Truthful mechanism design for bin packing with applications on cloud computing," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2224-2245, November.
    3. Sano, Ryuji, 2011. "Incentives in core-selecting auctions with single-minded bidders," Games and Economic Behavior, Elsevier, vol. 72(2), pages 602-606, June.
    4. Vijay Mohan & Peyman Khezr, 2024. "Blockchains, MEV and the knapsack problem: a primer," Papers 2403.19077, arXiv.org.
    5. Vöcking, Berthold, 2019. "A universally-truthful approximation scheme for multi-unit auctions," Games and Economic Behavior, Elsevier, vol. 113(C), pages 4-16.
    6. Jarman, Felix & Meisner, Vincent, 2015. "Ex-post optimal knapsack procurement," Working Papers 15-02, University of Mannheim, Department of Economics.
    7. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," Games and Economic Behavior, Elsevier, vol. 105(C), pages 59-83.
    8. Deshi Ye & Feng Xie & Guochuan Zhang, 0. "Truthful mechanism design for bin packing with applications on cloud computing," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    9. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," LSE Research Online Documents on Economics 83199, London School of Economics and Political Science, LSE Library.
    10. Stößer, Jochen & Neumann, Dirk & Weinhardt, Christof, 2010. "Market-based pricing in grids: On strategic manipulation and computational cost," European Journal of Operational Research, Elsevier, vol. 203(2), pages 464-475, June.
    11. 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.
    12. Fadaei, Salman & Bichler, Martin, 2017. "Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets," European Journal of Operational Research, Elsevier, vol. 260(2), pages 767-777.
    13. Bin Li & Dong Hao & Dengji Zhao, 2020. "Incentive-Compatible Diffusion Auctions," Papers 2001.06975, arXiv.org, revised Apr 2020.
    14. Babaioff, Moshe & Blumrosen, Liad, 2008. "Computationally-feasible truthful auctions for convex bundles," Games and Economic Behavior, Elsevier, vol. 63(2), pages 588-620, July.
    15. Peyman Khezr & Vijay Mohan & Lionel Page, 2024. "Strategic Bidding in Knapsack Auctions," Papers 2403.07928, arXiv.org, revised Apr 2024.
    16. Bian, Zheyong & Liu, Xiang, 2019. "Mechanism design for first-mile ridesharing based on personalized requirements part II: Solution algorithm for large-scale problems," Transportation Research Part B: Methodological, Elsevier, vol. 120(C), pages 172-192.
    17. Paul Dütting & Vasilis Gkatzelis & Tim Roughgarden, 2017. "The Performance of Deferred-Acceptance Auctions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 897-914, November.
    18. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.

  13. 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.

    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. Aviad Rubinstein & Raghuvansh R. Saxena & Clayton Thomas & S. Mathew Weinberg & Junyao Zhao, 2020. "Exponential Communication Separations between Notions of Selfishness," Papers 2012.14898, arXiv.org, revised Jun 2021.
    3. 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.
    4. , & ,, 2012. "Mechanism design and communication networks," Theoretical Economics, Econometric Society, vol. 7(3), September.
    5. Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CIRJE F-Series CIRJE-F-806, CIRJE, Faculty of Economics, University of Tokyo.
    6. 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.
    7. Kristóf Madarász & Andrea Prat, 2010. "Screening with an Approximate Type Space," STICERD - Theoretical Economics Paper Series 548, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
    8. Alon Eden & Michal Feldman & Ophir Friedler & Inbal Talgam-Cohen & S. Matthew Weinberg, 2021. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements," Operations Research, INFORMS, vol. 69(1), pages 188-206, January.
    9. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
    10. 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.
    11. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
    12. 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.
    13. Blume, Lawrence & Easley, David & Kleinberg, Jon & Kleinberg, Robert & Tardos, Éva, 2015. "Introduction to computer science and economic theory," Journal of Economic Theory, Elsevier, vol. 156(C), pages 1-13.
    14. Grigorieva, E. & Herings, P.J.J. & Müller, R.J. & Vermeulen, A.J., 2009. "Fraction auctions: the tradeoff between efficiency and running time," Research Memorandum 045, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    15. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    16. Timothy Van Zandt, 2008. "The Interplay Between Incentives and Communication Complexity in Mechanism Design," 2008 Meeting Papers 480, Society for Economic Dynamics.
    17. Ran Canetti & Amos Fiat & Yannai A. Gonczarowski, 2023. "Zero-Knowledge Mechanisms," Papers 2302.05590, arXiv.org.
    18. 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).
    19. Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
    20. 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.
    21. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
    22. Beardon, Alan F. & Rowat, Colin, 2013. "Efficient sets are small," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 367-374.
    23. Ryuji Sano, 2016. "Iterative Revelation Mechanisms," KIER Working Papers 937, Kyoto University, Institute of Economic Research.
    24. Madarász, Kristóf & Prat, Andrea, 2017. "Sellers with misspecified models," LSE Research Online Documents on Economics 87271, London School of Economics and Political Science, LSE Library.
    25. Babaioff, Moshe & Dobzinski, Shahar & Oren, Sigal, 2022. "Combinatorial auctions with endowment effect," Games and Economic Behavior, Elsevier, vol. 136(C), pages 255-273.
    26. 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.
    27. 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.
    28. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    29. Tierney, Ryan, 2021. "Simple Social Choice Rules for Exchange," Discussion Papers on Economics 4/2021, University of Southern Denmark, Department of Economics.
    30. Stefan Bergheimer & Estelle Cantillon & Mar Reguant, 2023. "Price and quantity discovery without commitment," ULB Institutional Repository 2013/368728, ULB -- Universite Libre de Bruxelles.
    31. Mu'alem, Ahuva, 2014. "Fair by design: Multidimensional envy-free mechanisms," Games and Economic Behavior, Elsevier, vol. 88(C), pages 29-46.
    32. 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.
    33. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
    34. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
    35. Fadaei, Salman & Bichler, Martin, 2017. "Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets," European Journal of Operational Research, Elsevier, vol. 260(2), pages 767-777.
    36. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
    37. Paul Milgrom, 2008. "Assignment Messages and Exchanges," Discussion Papers 08-014, Stanford Institute for Economic Policy Research.
    38. Dobzinski, Shahar & Nisan, Noam & Oren, Sigal, 2019. "Economic efficiency requires interaction," Games and Economic Behavior, Elsevier, vol. 118(C), pages 589-608.
    39. 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.
    40. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.
    41. Yiqing Xing & Anqi Li, 2014. "Simple Labor Income Tax Systems with Endogenous Employment Contracts," 2014 Meeting Papers 866, Society for Economic Dynamics.
    42. John H. Kagel & Yuanchuan Lien & Paul Milgrom, 2010. "Ascending Prices and Package Bidding: A Theoretical and Experimental Analysis," American Economic Journal: Microeconomics, American Economic Association, vol. 2(3), pages 160-185, August.
    43. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2024.
    44. Cole, Richard & Tao, Yixin, 2021. "On the existence of Pareto Efficient and envy-free allocations," Journal of Economic Theory, Elsevier, vol. 193(C).
    45. Fadel, Ronald & Segal, Ilya, 2009. "The communication cost of selfishness," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1895-1920, September.
    46. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.
    47. 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.
    48. Eiichiro Kazumori, 2010. "Core-Selecting Auctions: An Experimental Study," CARF F-Series CARF-F-226, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    49. Nisan, Noam, 2015. "Algorithmic Mechanism Design," Handbook of Game Theory with Economic Applications,, Elsevier.
    50. Perennes, Patricia, 2014. "Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 175-187.
    51. Martin Bichler & Pasha Shabalin & Jürgen Wolf, 2013. "Do core-selecting Combinatorial Clock Auctions always lead to high efficiency? An experimental analysis of spectrum auction designs," Experimental Economics, Springer;Economic Science Association, vol. 16(4), pages 511-545, December.
    52. Mehmet Barlo & Nuh Aygün Dalkıran, 2022. "Computational implementation," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 605-633, December.
    53. Daniel Lehmann, 2019. "Revealed Preferences for Matching with Contracts," Papers 1908.08823, arXiv.org, revised Mar 2020.
    54. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.
    55. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.

  14. 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.

    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. 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.
    3. 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.
    4. 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.
    5. Ostrovsky, Michael & Paes Leme, Renato, 2015. "Gross substitutes and endowed assignment valuations," Theoretical Economics, Econometric Society, vol. 10(3), September.
    6. Dobzinski, Shahar & Fu, Hu & Kleinberg, Robert, 2015. "Approximately optimal auctions for correlated bidders," Games and Economic Behavior, Elsevier, vol. 92(C), pages 349-369.
    7. 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.
    8. 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.
    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. Alfredo Torrico & Alejandro Toriello, 2022. "Dynamic Relaxations for Online Bipartite Matching," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1871-1884, July.
    12. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    13. 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.
    14. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    15. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
    16. 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).
    17. 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.
    18. Babaioff, Moshe & Blumrosen, Liad & Roth, Aaron, 2015. "Auctions with online supply," Games and Economic Behavior, Elsevier, vol. 90(C), pages 227-246.
    19. 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.
    20. Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
    21. 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.
    22. 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.
    23. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    24. 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.
    25. 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.
    26. 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.
    27. 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.
    28. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
    29. 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.
    30. 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.
    31. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
    32. Oren Ben-Zwi & Ilan Newman, 2023. "No Ascending Auction can find Equilibrium for SubModular valuations," Papers 2312.00522, arXiv.org.
    33. 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.
    34. 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.
    35. 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.
    36. 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.
    37. Fu, Hu & Kleinberg, Robert & Lavi, Ron & Smorodinsky, Rann, 2017. "Job security, stability and production efficiency," Theoretical Economics, Econometric Society, vol. 12(1), January.
    38. Dobzinski, Shahar & Nisan, Noam & Oren, Sigal, 2019. "Economic efficiency requires interaction," Games and Economic Behavior, Elsevier, vol. 118(C), pages 589-608.
    39. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
    40. 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.
    41. Lavi, Ron & Nisan, Noam, 2015. "Online ascending auctions for gradually expiring items," Journal of Economic Theory, Elsevier, vol. 156(C), pages 45-76.
    42. Moshe Babaioff & Uriel Feige, 2019. "A New Approach to Fair Distribution of Welfare," Papers 1909.11346, arXiv.org.
    43. 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.
    44. Feldman, Michal & Shabtai, Galia, 2023. "Simultaneous 2nd price item auctions with no-underbidding," Games and Economic Behavior, Elsevier, vol. 140(C), pages 316-340.
    45. Blumrosen, Liad & Dobzinski, Shahar, 2021. "(Almost) efficient mechanisms for bilateral trading," Games and Economic Behavior, Elsevier, vol. 130(C), pages 369-383.
    46. Eric Budish & Judd B. Kessler, 2016. "Can Market Participants Report their Preferences Accurately (Enough)?," NBER Working Papers 22448, National Bureau of Economic Research, Inc.
    47. 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.
    48. Tim Roughgarden & Inbal Talgam-Cohen, 2018. "Approximately Optimal Mechanism Design," Papers 1812.11896, arXiv.org, revised Aug 2020.
    49. Sher, Itai & Kim, Kyoo il, 2014. "Identifying combinatorial valuations from aggregate demand," Journal of Economic Theory, Elsevier, vol. 153(C), pages 428-458.
    50. Satoko Moriguchi & Kazuo Murota & Akihisa Tamura & Fabio Tardella, 2020. "Discrete Midpoint Convexity," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 99-128, February.
    51. 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.
    52. 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.
    53. Kittsteiner, Thomas & Ott, Marion & Steinberg, Richard, 2017. "Competing Combinatorial Auctions," EconStor Preprints 171995, ZBW - Leibniz Information Centre for Economics.
    54. Xiaofei Liu & Weidong Li & Yaoyu Zhu, 2021. "Single Machine Vector Scheduling with General Penalties," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    55. Daniel Lehmann, 2019. "Revealed Preferences for Matching with Contracts," Papers 1908.08823, arXiv.org, revised Mar 2020.
    56. 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.

  15. Sushil Bikhchandani & Shurojit Chatterji & Ron Lavi & Ahuva Mu'alem & Noam Nisan & Arunava Sen, 2006. "Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation," Econometrica, Econometric Society, vol. 74(4), pages 1109-1132, July.

    Cited by:

    1. Katherine Cuff & Sunghoon Hong & Jesse Schwartz & Quan Wen & John Weymark, 2012. "Dominant strategy implementation with a convex product space of valuations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 567-597, July.
    2. Debasis Mishra & Arunava Sen, 2010. "Roberts' theorem with neutrality: A Social welfare ordering approach," Discussion Papers 10-03, Indian Statistical Institute, Delhi.
    3. Juan Carlos Carbajal & Andrew McLennan & Rabee Tourky, 2012. "Truthful Implementation and Preference Aggregation in Restricted Domains," Discussion Papers Series 459, School of Economics, University of Queensland, Australia.
    4. Müller, R.J. & Perea ý Monsuwé, A. & Wolf, S., 2005. "Weak monotonicity and Bayes-Nash incentive compatibility," Research Memorandum 040, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    5. Kos, Nenad & Messner, Matthias, 2013. "Incentive compatibility in non-quasilinear environments," Economics Letters, Elsevier, vol. 121(1), pages 12-14.
    6. Rahman, David M., 2024. "Detecting profitable deviations," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    7. Levent Ulku, 2012. "Nonmonotone Mechanism Design," Working Papers 1202, Centro de Investigacion Economica, ITAM.
    8. Manipushpak Mitra & Arunava Sen, 2010. "Efficient allocation of heterogenous commodities with balanced transfers," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 35(1), pages 29-48, June.
    9. Carbajal, Juan Carlos, 2010. "On the uniqueness of Groves mechanisms and the payoff equivalence principle," Games and Economic Behavior, Elsevier, vol. 68(2), pages 763-772, March.
    10. Yoon, Kiho, 2020. "Implementability with contingent contracts," Economics Letters, Elsevier, vol. 188(C).
    11. Vincent Anesi, 2018. "Dynamic Legislative Policy Making under Adverse Selection," Discussion Papers 2018-08, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
    12. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    13. Heydenreich, B. & Müller, R.J. & Uetz, M.J. & Vohra, R., 2007. "Characterization of revenue equivalence," Research Memorandum 017, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    14. Philippe Jehiel & Moritz Meyer-Ter-Vehn & Benny Moldovanu, 2008. "Ex-post implementation and preference aggregation via potentials," Post-Print halshs-00754256, HAL.
    15. Thierry Marchant & Debasis Mishra, 2015. "Mechanism design with two alternatives in quasi-linear environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 433-455, February.
    16. S. M. Reza Dibaj & Ali Miri & SeyedAkbar Mostafavi, 2020. "A cloud dynamic online double auction mechanism (DODAM) for sustainable pricing," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 75(4), pages 461-480, December.
    17. Yu Chen & Zhenhua Wu, 2012. "Delegation Principle for Multi-agency Games under Ex Post Equilibrium," CAEPR Working Papers 2012-008, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    18. Alexey Kushnir & Shuo Liu, 2019. "On the equivalence of Bayesian and dominant strategy implementation for environments with nonlinear utilities," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 67(3), pages 617-644, April.
    19. Rahul Deb & Debasis Mishra, 2014. "Implementation with contingent contracts," Discussion Papers 14-01, Indian Statistical Institute, Delhi.
    20. Juan Carlos Carbajal & Rudolf Müller, 2015. "Implementability under Monotonic Transformations in Differences," Working Papers 37, Peruvian Economic Association.
    21. Paul H. Edelman & John A. Weymark, 2021. "Dominant strategy implementability and zero length cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(4), pages 1091-1120, November.
    22. Georgiou, Konstantinos & Swamy, Chaitanya, 2019. "Black-box reductions for cost-sharing mechanism design," Games and Economic Behavior, Elsevier, vol. 113(C), pages 17-37.
    23. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
    24. Paul H. Edelman & John A Weymark, 2017. "Dominant Strategy Implementability, Zero Length Cycles, and Affine Maximizers," Vanderbilt University Department of Economics Working Papers 17-00002, Vanderbilt University Department of Economics.
    25. Carbajal, Juan Carlos & Müller, Rudolf, 2017. "Monotonicity and revenue equivalence domains by monotonic transformations in differences," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 29-35.
    26. Fasil Alemante & Donald E. Campbell & Jerry S. Kelly, 2016. "Characterizing the resolute part of monotonic social choice correspondences," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 62(4), pages 765-783, October.
    27. Mishra, Debasis & Pramanik, Anup & Roy, Souvik, 2014. "Multidimensional mechanism design in single peaked type spaces," Journal of Economic Theory, Elsevier, vol. 153(C), pages 103-116.
    28. Hitoshi Matsushima, 2011. "Efficient Combinatorial Exchanges with Opt-Out Types (Revised version of CARF-F-258)(Published in the B. E. Journal of Theoretical Economics 19 (1), 2019.)," CARF F-Series CARF-F-294, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo, revised Aug 2012.
    29. , & ,, 2013. "Implementation in multidimensional dichotomous domains," Theoretical Economics, Econometric Society, vol. 8(2), May.
    30. Postl Peter, 2011. "Strategy-Proof Compromises," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-37, October.
    31. Birgit Heydenreich & Rudolf Müller & Marc Uetz, 2010. "Mechanism Design for Decentralized Online Machine Scheduling," Operations Research, INFORMS, vol. 58(2), pages 445-457, April.
    32. Debasis Mishra & Anup Pramanik & Souvik Roy, 2013. "Implementation in multidimensional domains with ordinal restrictions," Discussion Papers 13-07, Indian Statistical Institute, Delhi.
    33. Rochet, Jean-Charles, 2024. "Multidimensional screening after 37 years," Journal of Mathematical Economics, Elsevier, vol. 113(C).
    34. Carbajal, Juan Carlos & Ely, Jeffrey C., 2013. "Mechanism design without revenue equivalence," Journal of Economic Theory, Elsevier, vol. 148(1), pages 104-133.
    35. Berger, A. & Müller, R.J. & Naeemi, S.H., 2010. "Path-monotonicity and incentive compatibility," Research Memorandum 035, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    36. Tang, Rui & Zhang, Mu, 2021. "Maxmin implementation," Journal of Economic Theory, Elsevier, vol. 194(C).
    37. Frongillo, Rafael M. & Kash, Ian A., 2021. "General truthfulness characterizations via convex analysis," Games and Economic Behavior, Elsevier, vol. 130(C), pages 636-662.
    38. Debasis Mishra & Abdul Quadir, 2012. "Deterministic single object auctions with private values," Discussion Papers 12-06, Indian Statistical Institute, Delhi.
    39. Mohammad Akbarpour & Scott Duke Kominers & Kevin Michael Li & Shengwu Li & Paul Milgrom, 2023. "Algorithmic Mechanism Design With Investment," Econometrica, Econometric Society, vol. 91(6), pages 1969-2003, November.
    40. Caleb Koch, 2020. "Implementation with ex post hidden actions," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 5(1), pages 1-35, December.
    41. Hitoshi Matsushima, 2011. "Efficient Combinatorial Exchanges," CIRJE F-Series CIRJE-F-826, CIRJE, Faculty of Economics, University of Tokyo.
    42. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    43. Ron Lavi & Ahuva Mu’alem & Noam Nisan, 2009. "Two simplified proofs for Roberts’ theorem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(3), pages 407-423, March.
    44. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Mechanism design without quasilinearity," Discussion Papers 17-04, Indian Statistical Institute, Delhi.
    45. M. Yenmez, 2015. "Incentive compatible market design with applications," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 543-569, August.
    46. Rahul Deb & Debasis Mishra, 2013. "Implementation with securities," Discussion Papers 13-05, Indian Statistical Institute, Delhi.
    47. Bin Li & Dong Hao & Dengji Zhao, 2020. "Incentive-Compatible Diffusion Auctions," Papers 2001.06975, arXiv.org, revised Apr 2020.
    48. Carbajal, Juan Carlos & Mu'alem, Ahuva, 2020. "Selling mechanisms for a financially constrained buyer," Games and Economic Behavior, Elsevier, vol. 124(C), pages 386-405.
    49. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.
    50. Leucci, Stefano & Mamageishvili, Akaki & Penna, Paolo, 2018. "No truthful mechanism can be better than n approximate for two natural problems," Games and Economic Behavior, Elsevier, vol. 111(C), pages 64-74.
    51. Fadel, Ronald & Segal, Ilya, 2009. "The communication cost of selfishness," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1895-1920, September.
    52. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.
    53. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage," Working Papers e116, Tokyo Center for Economic Research.
    54. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
    55. Yi, Jianxin, 2011. "Implementation via mechanisms with transfers," Mathematical Social Sciences, Elsevier, vol. 61(1), pages 65-70, January.
    56. Archer, Aaron & Kleinberg, Robert, 2014. "Truthful germs are contagious: A local-to-global characterization of truthfulness," Games and Economic Behavior, Elsevier, vol. 86(C), pages 340-366.
    57. Lavi, Ron & Swamy, Chaitanya, 2009. "Truthful mechanism design for multidimensional scheduling via cycle monotonicity," Games and Economic Behavior, Elsevier, vol. 67(1), pages 99-124, September.
    58. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.
    59. Alexey Kushnir & Vinod Krishnamoorthy, 2022. "A Simple Characterization of Supply Correspondences," Papers 2205.10472, arXiv.org.

  16. Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.

    Cited by:

    1. Xiayan Cheng & Rongheng Li & Yunxia Zhou, 2022. "Tighter price of anarchy for selfish task allocation on selfish machines," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1848-1879, October.
    2. Heydenreich, B. & Müller, R.J. & Uetz, M.J., 2006. "Decentralization and mechanism design for online machine scheduling," Research Memorandum 007, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Churkin, Andrey & Bialek, Janusz & Pozo, David & Sauma, Enzo & Korgin, Nikolay, 2021. "Review of Cooperative Game Theory applications in power system expansion planning," Renewable and Sustainable Energy Reviews, Elsevier, vol. 145(C).
    4. Edith Cohen & Michal Feldman & Amos Fiat & Haim Kaplan & Svetlana Olonetsky, 2010. "Envy-Free Makespan Approximation," Discussion Paper Series dp539, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    5. Levin, Hagay & Schapira, Michael & Zohar, Aviv, 2006. "The Strategic Justification for BGP," MPRA Paper 2110, University Library of Munich, Germany.
    6. Babaioff, Moshe & Nisan, Noam & Pavlov, Elan, 2009. "Mechanisms for a spatially distributed market," Games and Economic Behavior, Elsevier, vol. 66(2), pages 660-684, July.
    7. Holzman, Ron & Kfir-Dahav, Noa & Monderer, Dov & Tennenholtz, Moshe, 2004. "Bundling equilibrium in combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 47(1), pages 104-123, April.
    8. Levin, Hagay & Schapira, Michael & Zohar, Aviv, 2008. "Interdomain routing and games," MPRA Paper 8476, University Library of Munich, Germany.
    9. Archer, Aaron & Feigenbaum, Joan & Krishnamurthy, Arvind & Sami, Rahul & Shenker, Scott, 2004. "Approximation and collusion in multicast cost sharing," Games and Economic Behavior, Elsevier, vol. 47(1), pages 36-71, April.
    10. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," CRC TR 224 Discussion Paper Series crctr224_2019_124, University of Bonn and University of Mannheim, Germany.
    11. Aziz, Haris & Chan, Hau & Lee, Barton E. & Parkes, David C., 2020. "The capacity constrained facility location problem," Games and Economic Behavior, Elsevier, vol. 124(C), pages 478-490.
    12. Edna Tusak Loehman & Richard Kiser & Stephen J. Rassenti, 2014. "Cost Share Adjustment Processes for Cooperative Group Decisions About Shared Goods: A Design Approach," Group Decision and Negotiation, Springer, vol. 23(5), pages 1085-1126, September.
    13. Penna, Paolo & Ventre, Carmine, 2014. "Optimal collusion-resistant mechanisms with verification," Games and Economic Behavior, Elsevier, vol. 86(C), pages 491-509.
    14. Jan Balaguer & Raphael Koster & Ari Weinstein & Lucy Campbell-Gillingham & Christopher Summerfield & Matthew Botvinick & Andrea Tacchetti, 2022. "HCMD-zero: Learning Value Aligned Mechanisms from Data," Papers 2202.10122, arXiv.org, revised May 2022.
    15. Rachel R. Chen & Robin O. Roundy & Rachel Q. Zhang & Ganesh Janakiraman, 2005. "Efficient Auction Mechanisms for Supply Chain Procurement," Management Science, INFORMS, vol. 51(3), pages 467-482, March.
    16. 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.
    17. Gabrielle Demange, 2018. "Mechanisms in a Digitalized World," CESifo Working Paper Series 6984, CESifo.
    18. Alex Gershkov & Benny Moldovanu & Xianwen Shi, 2017. "Optimal Voting Rules," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 84(2), pages 688-717.
    19. Michal Feldman & Tami Tamir, 2012. "Conflicting Congestion Effects in Resource Allocation Games," Operations Research, INFORMS, vol. 60(3), pages 529-540, June.
    20. Mitra, Manipushpak & De, Parikshit, 2015. "Incentives and justice for sequencing problems," MPRA Paper 65447, University Library of Munich, Germany.
    21. Rahul Deb & Debasis Mishra, 2014. "Implementation with contingent contracts," Discussion Papers 14-01, Indian Statistical Institute, Delhi.
    22. Bhavook Bhardwaj & Siddharth Chatterjee, 2022. "Decisions over Sequences," Papers 2203.00070, arXiv.org, revised Sep 2022.
    23. Sharma, Yogeshwer & Williamson, David P., 2009. "Stackelberg thresholds in network routing games or the value of altruism," Games and Economic Behavior, Elsevier, vol. 67(1), pages 174-190, September.
    24. Haris Aziz & Alexander Lam & Barton E. Lee & Toby Walsh, 2021. "Strategyproof and Proportionally Fair Facility Location," Papers 2111.01566, arXiv.org, revised Nov 2023.
    25. Dobzinski, Shahar & Nisan, Noam, 2015. "Multi-unit auctions: Beyond Roberts," Journal of Economic Theory, Elsevier, vol. 156(C), pages 14-44.
    26. Kimmo Berg & Harri Ehtamo, 2012. "Continuous learning methods in two-buyer pricing problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(3), pages 287-304, June.
    27. Kimmo Berg & Harri Ehtamo, 2009. "Learning in nonlinear pricing with unknown utility functions," Annals of Operations Research, Springer, vol. 172(1), pages 375-392, November.
    28. Kwang Mong Sim, 2023. "An Incentive-Compatible and Computationally Efficient Fog Bargaining Mechanism," Computational Economics, Springer;Society for Computational Economics, vol. 62(4), pages 1883-1918, December.
    29. Dominik Kress & Sebastian Meiswinkel & Erwin Pesch, 2018. "Mechanism design for machine scheduling problems: classification and literature overview," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 583-611, July.
    30. Ding, Xiaoshu & Qi, Qi & Jian, Sisi & Yang, Hai, 2023. "Mechanism design for Mobility-as-a-Service platform considering travelers’ strategic behavior and multidimensional requirements," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 1-30.
    31. Birgit Heydenreich & Rudolf Müller & Marc Uetz, 2010. "Mechanism Design for Decentralized Online Machine Scheduling," Operations Research, INFORMS, vol. 58(2), pages 445-457, April.
    32. Widmer, Tobias & Leukel, Joerg, 2016. "Efficiency of electronic service allocation with privately known quality," European Journal of Operational Research, Elsevier, vol. 255(3), pages 856-868.
    33. Ketter, W. & Collins, J. & Reddy, P. & Flath, C., 2011. "The Power Trading Agent Competition," ERIM Report Series Research in Management ERS-2011-011-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    34. Xin Chen & Qizhi Fang & Wenjing Liu & Yuan Ding & Qingqin Nong, 2022. "Strategyproof mechanisms for 2-facility location games with minimax envy," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1628-1644, July.
    35. Benjamin Blau & Clemens Dinther & Tobias Conte & Yongchun Xu & Christof Weinhardt, 2009. "How to Coordinate Value Generation in Service Networks," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(5), pages 343-356, October.
    36. Bichler, Martin & Goeree, Jacob K., 2017. "Frontiers in spectrum auction design," International Journal of Industrial Organization, Elsevier, vol. 50(C), pages 372-391.
    37. Mu'alem, Ahuva, 2014. "Fair by design: Multidimensional envy-free mechanisms," Games and Economic Behavior, Elsevier, vol. 88(C), pages 29-46.
    38. 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.
    39. Khorasany, Mohsen & Razzaghi, Reza & Shokri Gazafroudi, Amin, 2021. "Two-stage mechanism design for energy trading of strategic agents in energy communities," Applied Energy, Elsevier, vol. 295(C).
    40. Xiayan Cheng & Rongheng Li & Yunxia Zhou, 0. "Tighter price of anarchy for selfish task allocation on selfish machines," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-32.
    41. Moshe Babaioff & Yoav Kolumbus & Eyal Winter, 2020. "Optimal Collaterals in Multi-Enterprise Investment Networks," Papers 2011.06247, arXiv.org, revised Mar 2022.
    42. Laor Boongasame & Farhad Daneshgar, 2016. "An awareness-based meta-mechanism for e-commerce buyer coalitions," Information Systems Frontiers, Springer, vol. 18(3), pages 529-540, June.
    43. Joseph Y. Halpern, 2007. "Computer Science and Game Theory: A Brief Survey," Papers cs/0703148, arXiv.org.
    44. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," Papers 1908.05556, arXiv.org, revised Jul 2024.
    45. Jiangtao Li & Piotr Dworczak, 2020. "Are simple mechanisms optimal when agents are unsophisticated?," GRAPE Working Papers 42, GRAPE Group for Research in Applied Economics.
    46. Crescenzio Gallo, 2005. "The design and development of Mobile Ad Hoc Networks," Quaderni DSEMS 05-2005, Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia.
    47. 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.
    48. Alex Gershkov & Benny Moldovanu & Xianwen Shi, 2013. "Optimal Mechanism Design without Money," Working Papers tecipa-481, University of Toronto, Department of Economics.
    49. Yuan Gao & Christian Kroer, 2020. "Infinite-Dimensional Fisher Markets and Tractable Fair Division," Papers 2010.03025, arXiv.org, revised Apr 2021.
    50. Briskorn, Dirk & Waldherr, Stefan, 2022. "Anarchy in the UJ: Coordination mechanisms for minimizing the number of late jobs," European Journal of Operational Research, Elsevier, vol. 301(3), pages 815-827.
    51. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.
    52. Rahul Deb & Debasis Mishra, 2013. "Implementation with securities," Discussion Papers 13-05, Indian Statistical Institute, Delhi.
    53. M. Y. Jumba & Y. S. Haruna & U. O. Aliyu & A. L. Amao, 2024. "Application of Games Theory in Modelling of Nigerian Electricity Market," International Journal of Research and Scientific Innovation, International Journal of Research and Scientific Innovation (IJRSI), vol. 11(5), pages 1129-1140, May.
    54. Egri, Péter & Váncza, József, 2013. "A distributed coordination mechanism for supply networks with asymmetric information," European Journal of Operational Research, Elsevier, vol. 226(3), pages 452-460.
    55. Antonio Fernández Anta & Chryssis Georgiou & Miguel A Mosteiro & Daniel Pareja, 2015. "Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-22, March.
    56. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Levine's Bibliography 843644000000000184, UCLA Department of Economics.
    57. Babaioff, Moshe & Blumrosen, Liad, 2008. "Computationally-feasible truthful auctions for convex bundles," Games and Economic Behavior, Elsevier, vol. 63(2), pages 588-620, July.
    58. Leucci, Stefano & Mamageishvili, Akaki & Penna, Paolo, 2018. "No truthful mechanism can be better than n approximate for two natural problems," Games and Economic Behavior, Elsevier, vol. 111(C), pages 64-74.
    59. Heydenreich, B. & Müller, R.J. & Uetz, M.J., 2006. "Games and mechanism design in machine scheduling - an introduction," Research Memorandum 022, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    60. Tim Roughgarden & Inbal Talgam-Cohen, 2018. "Approximately Optimal Mechanism Design," Papers 1812.11896, arXiv.org, revised Aug 2020.
    61. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, November.
    62. Haris Aziz & Alexander Lam & Mashbat Suzuki & Toby Walsh, 2022. "Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism," Papers 2205.14798, arXiv.org, revised Jun 2022.
    63. Nisan, Noam, 2015. "Algorithmic Mechanism Design," Handbook of Game Theory with Economic Applications,, Elsevier.
    64. Paul Gölz & Dominik Peters & Ariel Procaccia, 2022. "In This Apportionment Lottery, the House Always Wins," Post-Print hal-03834513, HAL.
    65. Peter J Phillips & Gabriela Pohl, 2024. "Information, Uncertainty & Espionage," The Review of Austrian Economics, Springer;Society for the Development of Austrian Economics, vol. 37(1), pages 35-54, March.
    66. Kenryo Indo, 2007. "Proving Arrow’s theorem by PROLOG," Computational Economics, Springer;Society for Computational Economics, vol. 30(1), pages 57-63, August.
    67. Lavi, Ron & Swamy, Chaitanya, 2009. "Truthful mechanism design for multidimensional scheduling via cycle monotonicity," Games and Economic Behavior, Elsevier, vol. 67(1), pages 99-124, September.
    68. Blumrosen, Liad & Feldman, Michal, 2013. "Mechanism design with a restricted action space," Games and Economic Behavior, Elsevier, vol. 82(C), pages 424-443.
    69. Richa Agarwal & Özlem Ergun, 2010. "Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping," Operations Research, INFORMS, vol. 58(6), pages 1726-1742, December.
    70. Mu'alem, Ahuva & Schapira, Michael, 2018. "Setting lower bounds on truthfulness," Games and Economic Behavior, Elsevier, vol. 110(C), pages 174-193.
    71. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Discussion Paper Series dp452, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

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