On Ascending Vickrey Auctions for Heterogeneous Objects

Citations

Cited by:

1. Mishra, D. & Talman, A.J.J., 2006. "Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands," Discussion Paper 2006-84, Tilburg University, Center for Economic Research.
   • Debasis Mishra & Dolf Talman, 2007. "Overdemand and underdemand in economies with indivisible goods and unit demand," Discussion Papers 07-03, Indian Statistical Institute, Delhi.
   • Mishra, D. & Talman, A.J.J., 2006. "Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands," Other publications TiSEM ffa225a4-3180-4f9a-993c-3, Tilburg University, School of Economics and Management.
2. Minghui Lai & Weili Xue & Qian Hu, 2019. "An Ascending Auction for Freight Forwarder Collaboration in Capacity Sharing," Transportation Science, INFORMS, vol. 53(4), pages 1175-1195, July.
3. Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
4. Ioannis Petrakis & Georg Ziegler & Martin Bichler, 2013. "Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules," Information Systems Research, INFORMS, vol. 24(3), pages 768-786, September.
5. Andersson, Tommy & Andersson, Christer & Andersson, Ola, 2010. "Sealed Bid Auctions vs. Ascending Bid Auctions: An Experimental Study," Working Papers 2010:17, Lund University, Department of Economics.
   • Andersson, Christer & Andersson, Ola & Andersson, Tommy, 2011. "Sealed Bid Auctions vs. Ascending Bid Auctions: An Experimental Study," Working Paper Series 882, Research Institute of Industrial Economics.
6. Lamy, Laurent, 2012. "On minimal ascending auctions with payment discounts," Games and Economic Behavior, Elsevier, vol. 75(2), pages 990-999.
   • Laurent Lamy, 2012. "On minimal ascending auctions with payment discounts," PSE - Labex "OSE-Ouvrir la Science Economique" halshs-00754581, HAL.
   • Laurent Lamy, 2012. "On minimal ascending auctions with payment discounts," PSE-Ecole d'économie de Paris (Postprint) halshs-00754581, HAL.
   • Laurent Lamy, 2012. "On minimal ascending auctions with payment discounts," Post-Print halshs-00754581, HAL.
7. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
8. Martin Bichler & Pasha Shabalin & Alexander Pikovsky, 2009. "A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats," Information Systems Research, INFORMS, vol. 20(1), pages 33-59, March.
9. Andersson, Tommy & Andersson, Christer & Talman, Adolphus Johannes Jan, 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Working Papers 2010:15, Lund University, Department of Economics, revised 28 Jun 2012.
   • Andersson, T.D. & Andersson, C. & Talman, A.J.J., 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Discussion Paper 2010-51, Tilburg University, Center for Economic Research.
   • Andersson, T.D. & Andersson, C. & Talman, A.J.J., 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Other publications TiSEM c7482a22-cb73-428b-9cc0-e, Tilburg University, School of Economics and Management.
10. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    • MISHRA, Debasis & PARKES, David C., 2005. "Ascending price Vickrey auctions for general valuations," LIDAM Discussion Papers CORE 2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
11. Mishra, Debasis & Veeramani, Dharmaraj, 2007. "Vickrey-Dutch procurement auction for multiple items," European Journal of Operational Research, Elsevier, vol. 180(2), pages 617-629, July.
12. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
    • Tomoya Kazumura & Shigehiro Serizawa, 2015. "Efficiency and strategy-proofness in object assignment problems with multi demand preferences," ISER Discussion Paper 0943, Institute of Social and Economic Research, Osaka University.
13. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
14. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," PSE Working Papers halshs-00575076, HAL.
15. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
16. Shirata, Yasuhiro, 2017. "First price package auction with many traders," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 71-83.
    • Shirata, Yasuhiro, 2013. "First Price Package Auction with Many Traders," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/5134, Otaru University of Commerce.
17. 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.
18. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
    • Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2005. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Levine's Bibliography 784828000000000133, UCLA Department of Economics.
19. 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.
20. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
    • Debasis Mishra & David C. Parkes, 2007. "Multi-item Vickrey-Dutch auctions," Discussion Papers 07-04, Indian Statistical Institute, Delhi.
21. Grigorieva, Elena & Jean-Jacques Herings, P. & Müller, Rudolf & Vermeulen, Dries, 2012. "Fraction auctions: The tradeoff between efficiency and running time," European Journal of Operational Research, Elsevier, vol. 220(2), pages 577-587.
    • 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).
22. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
    • Debasis Mishra & Dolf Talman, 2008. "Characterization of the walrasian equilibria of the assignment model," Discussion Papers 08-07, Indian Statistical Institute, Delhi.
    • Mishra, D. & Talman, A.J.J., 2010. "Characterization of the Walrasian equilibria of the assignment model," Other publications TiSEM 3e249b02-c0f4-4ccf-bd37-f, Tilburg University, School of Economics and Management.
23. 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.
24. Akiyoshi Shioura & Zaifu Yang, 2013. "Equilibrium, Auction, Multiple Substitutes and Complements," Discussion Papers 13/17, Department of Economics, University of York.
25. Juan Aparicio & Mercedes Landete & Juan Monge & Inmaculada Sirvent, 2008. "A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(2), pages 319-344, December.
26. , & ,, 2015. "Strategy-proofness and efficiency with non-quasi-linear preferences: a characterization of minimum price Walrasian rule," Theoretical Economics, Econometric Society, vol. 10(2), May.
    • Shuhei Morimoto & Shigehiro Serizawa, 2012. "Strategy-proofness and Efficiency with Nonquasi-linear Preferences: A Characterization of Minimum Price Walrasian Rule," ISER Discussion Paper 0852, Institute of Social and Economic Research, Osaka University.
27. 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.
28. Ryuji Sano, 2016. "Iterative Revelation Mechanisms," KIER Working Papers 937, Kyoto University, Institute of Economic Research.
29. Christer Andersson & Ola Andersson & Tommy Andersson, 2013. "Sealed bid auctions versus ascending bid auctions: an experimental study," Review of Economic Design, Springer;Society for Economic Design, vol. 17(1), pages 1-16, March.
30. Laurent Lamy, 2007. "Contingent Auctions with Allocative Externalities : Vickrey Versus the Ausubel-Milgrom Proxy Auction," Working Papers 2007-26, Center for Research in Economics and Statistics.
31. Laurent Lamy, 2007. "Contingent Auctions with Allocative Externalities: Vickrey vs. the Ausubel-Milgrom Proxy Auction," 2007 Meeting Papers 427, Society for Economic Dynamics.
32. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
33. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
34. MILLER, Andrew J. & MISHRA, Debasis & VEERAMANI, Dharmaraj, 2005. "Mechanism design for multiple item procurement using a distributed ellipsoid algorithm," LIDAM Discussion Papers CORE 2005087, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
35. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," Working Papers halshs-00575076, HAL.
36. Mingrong Wang & Mingxi Wang & Lihua Lang, 2017. "Reconsidering Carbon Permits Auction Mechanism: An Efficient Dynamic Model," The World Economy, Wiley Blackwell, vol. 40(8), pages 1624-1645, August.
37. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
38. Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
39. 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.
40. Tobias Scheffel & Alexander Pikovsky & Martin Bichler & Kemal Guler, 2011. "An Experimental Comparison of Linear and Nonlinear Price Combinatorial Auctions," Information Systems Research, INFORMS, vol. 22(2), pages 346-368, June.
41. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    • Andersson, Tommy & Erlanson, Albin, 2012. "Multi-Item Vickery-English-Dutch Auctions," Working Papers 2012:17, Lund University, Department of Economics, revised 15 Jan 2013.
42. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
43. Robert W. Day & S. Raghavan, 2007. "Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions," Management Science, INFORMS, vol. 53(9), pages 1389-1406, September.
44. Laurent Lamy, 2007. "The Ausubel-Milgrom Proxy Auction with Final Discounts," Working Papers 2007-25, Center for Research in Economics and Statistics.
45. Bichler, Martin & Waldherr, Stefan, 2017. "Core and pricing equilibria in combinatorial exchanges," Economics Letters, Elsevier, vol. 157(C), pages 145-147.
46. Bikhchandani, Sushil & Ostroy, Joseph M., 2006. "Ascending price Vickrey auctions," Games and Economic Behavior, Elsevier, vol. 55(2), pages 215-241, May.
47. Andersson, Tommy & Svensson, Lars-Gunnar, 2018. "Sequential rules for house allocation with price restrictions," Games and Economic Behavior, Elsevier, vol. 107(C), pages 41-59.
    • Andersson, Tommy & Svensson, Lars-Gunnar, 2015. "Sequential Rules for House Allocation with Price Restrictions," Working Papers 2015:18, Lund University, Department of Economics, revised 11 Oct 2017.
48. Ervasti, Valtteri & Leskelä, Riikka-Leena, 2010. "Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support," European Journal of Operational Research, Elsevier, vol. 203(1), pages 251-260, May.
49. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
50. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.