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

Ascending price Vickrey auctions for general valuations

Citations

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


Cited by:

  1. Mishra, D. & Talman, A.J.J., 2006. "Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands," Discussion Paper 2006-84, Tilburg University, Center for Economic Research.
  2. Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
  3. 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. 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.
  5. Matsushima Hitoshi, 2018. "Connected Price Dynamics with Revealed Preferences and Auctioneer’s Discretion in VCG Combinatorial Auction," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 18(1), pages 1-16, January.
  6. Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CARF F-Series CARF-F-261, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
  7. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
  8. Michael H. Rothkopf, 2007. "Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical," Operations Research, INFORMS, vol. 55(2), pages 191-197, April.
  9. Lamy, Laurent, 2012. "On minimal ascending auctions with payment discounts," Games and Economic Behavior, Elsevier, vol. 75(2), pages 990-999.
  10. 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.
  11. Chen, Yan & Takeuchi, Kan, 2010. "Multi-object auctions with package bidding: An experimental comparison of Vickrey and iBEA," Games and Economic Behavior, Elsevier, vol. 68(2), pages 557-579, March.
  12. 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.
  13. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
  14. 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.
  15. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
  16. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
  17. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," PSE Working Papers halshs-00575076, HAL.
  18. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
  19. Shirata, Yasuhiro, 2017. "First price package auction with many traders," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 71-83.
  20. 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.
  21. 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.
  22. Mishra, Debasis & Parkes, David C., 2009. "Multi-item Vickrey-Dutch auctions," Games and Economic Behavior, Elsevier, vol. 66(1), pages 326-347, May.
  23. 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.
  24. Sano, Ryuji, 2011. "Incentives in core-selecting auctions with single-minded bidders," Games and Economic Behavior, Elsevier, vol. 72(2), pages 602-606, June.
  25. 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.
  26. Akiyoshi Shioura & Zaifu Yang, 2013. "Equilibrium, Auction, Multiple Substitutes and Complements," Discussion Papers 13/17, Department of Economics, University of York.
  27. , & ,, 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.
  28. Ayman Chouayakh & Aurélien Bechler & Isabel Amigo & Loutfi Nuaymi & Patrick Maillé, 2021. "A truthful ascending auction mechanism for dynamic allocation of LSA spectrum blocks," Netnomics, Springer, vol. 22(1), pages 27-52, June.
  29. Ryuji Sano, 2016. "Iterative Revelation Mechanisms," KIER Working Papers 937, Kyoto University, Institute of Economic Research.
  30. Hitoshi Matsushima, 2015. "Connected Price Dynamics with Revealed Preferences and Auctioneer’s Discretionin VCG Combinatorial Auction (Published in the B. E. Journal of Theoretical Economics 18 (1), 2018.)," CARF F-Series CARF-F-359, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
  31. 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.
  32. 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.
  33. Laurent Lamy, 2007. "Contingent Auctions with Allocative Externalities: Vickrey vs. the Ausubel-Milgrom Proxy Auction," 2007 Meeting Papers 427, Society for Economic Dynamics.
  34. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
  35. 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.
  36. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
  37. Laurent Lamy, 2009. "Ascending auctions: some impossibility results and their resolutions with final price discounts," Working Papers halshs-00575076, HAL.
  38. Ryuji Sano, 2021. "Dynamic communication mechanism design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 163-180, July.
  39. 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.
  40. 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.
  41. 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.
  42. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
  43. Ozan Candogan & Saša Pekeč, 2018. "Efficient Allocation and Pricing of Multifeatured Items," Management Science, INFORMS, vol. 64(12), pages 5521-5543, December.
  44. Ben-Zwi, Oren, 2017. "Walrasian's characterization and a universal ascending auction," Games and Economic Behavior, Elsevier, vol. 104(C), pages 456-467.
  45. Xu, Su Xiu & Cheng, Meng & Huang, George Q., 2015. "Efficient intermodal transportation auctions for B2B e-commerce logistics with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 322-337.
  46. Laurent Lamy, 2007. "The Ausubel-Milgrom Proxy Auction with Final Discounts," Working Papers 2007-25, Center for Research in Economics and Statistics.
  47. Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
  48. 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.
  49. Zaifu Yang & Jingsheng Yu, 2018. "Efficient Ascending Menu Auctions with Budget Constrained Bidders," Discussion Papers 18/09, Department of Economics, University of York.
  50. Eleni Batziou & Martin Bichler & Maximilian Fichtl, 2022. "Core-Stability in Assignment Markets with Financially Constrained Buyers," Papers 2205.06132, arXiv.org.
  51. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
  52. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.