IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v48y2002i11p1388-1407.html
   My bibliography  Save this item

Optimal Dynamic Auctions for Revenue Management

Citations

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


Cited by:

  1. Hamid Nazerzadeh & Amin Saberi & Rakesh Vohra, 2013. "Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising," Operations Research, INFORMS, vol. 61(1), pages 98-111, February.
  2. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
  3. Ghate, Archis, 2015. "Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning," European Journal of Operational Research, Elsevier, vol. 245(2), pages 555-570.
  4. Liu, Shuren & Liu, Changgeng & Hu, Qiying, 2013. "Optimal procurement strategies by reverse auctions with stochastic demand," Economic Modelling, Elsevier, vol. 35(C), pages 430-435.
  5. Sun, Daewon & Li, Erick & Hayya, Jack C., 2010. "The optimal format to sell a product through the internet: Posted price, auction, and buy-price auction," International Journal of Production Economics, Elsevier, vol. 127(1), pages 147-157, September.
  6. 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.
  7. Yiwei Chen & Vivek F. Farias & Nikolaos Trichakis, 2019. "On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers," Management Science, INFORMS, vol. 65(12), pages 5535-5555, December.
  8. Hummel, Patrick, 2015. "Simultaneous use of auctions and posted prices," European Economic Review, Elsevier, vol. 78(C), pages 269-284.
  9. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
  10. Woonghee Tim Huh & Ganesh Janakiraman, 2008. "Inventory Management with Auctions and Other Sales Channels: Optimality of (s, S) Policies," Management Science, INFORMS, vol. 54(1), pages 139-150, January.
  11. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
  12. Tao Zhang & Quanyan Zhu, 2019. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Papers 1909.13720, arXiv.org, revised May 2021.
  13. Jihyeok Jung & Chan-Oi Song & Deok-Joo Lee & Kiho Yoon, 2024. "Optimal Mechanism in a Dynamic Stochastic Knapsack Environment," Papers 2402.14269, arXiv.org.
  14. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
  15. Raphael Boleslavsky & Maher Said, 2013. "Progressive Screening: Long-Term Contracting with a Privately Known Stochastic Process," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 80(1), pages 1-34.
  16. 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.
  17. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
  18. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
  19. Garrett van Ryzin & Gustavo Vulcano, 2004. "Optimal Auctioning and Ordering in an Infinite Horizon Inventory-Pricing System," Operations Research, INFORMS, vol. 52(3), pages 346-367, June.
  20. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
  21. Xuanming Su & Fuqiang Zhang, 2008. "Strategic Customer Behavior, Commitment, and Supply Chain Performance," Management Science, INFORMS, vol. 54(10), pages 1759-1773, October.
  22. Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  23. Yiwei Chen & Vivek F. Farias, 2018. "Robust Dynamic Pricing with Strategic Customers," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1119-1142, November.
  24. René Caldentey & Gustavo Vulcano, 2007. "Online Auction and List Price Revenue Management," Management Science, INFORMS, vol. 53(5), pages 795-813, May.
  25. Constantinos Maglaras & Joern Meissner, 2006. "Dynamic Pricing Strategies for Multiproduct Revenue Management Problems," Manufacturing & Service Operations Management, INFORMS, vol. 8(2), pages 136-148, July.
  26. Jason Kuruzovich & Siva Viswanathan & Ritu Agarwal, 2010. "Seller Search and Market Outcomes in Online Auctions," Management Science, INFORMS, vol. 56(10), pages 1702-1717, October.
  27. Vibhanshu Abhishek & Mustafa Dogan & Alexandre Jacquillat, 2021. "Strategic Timing and Dynamic Pricing for Online Resource Allocation," Management Science, INFORMS, vol. 67(8), pages 4880-4907, August.
  28. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
  29. Christopher P. Wright & Harry Groenevelt & Robert A. Shumsky, 2010. "Dynamic Revenue Management in Airline Alliances," Transportation Science, INFORMS, vol. 44(1), pages 15-37, February.
  30. Yu Ning & Su Xiu Xu & George Q. Huang & Xudong Lin, 2021. "Optimal digital product auctions with unlimited supply and rebidding behavior," Annals of Operations Research, Springer, vol. 307(1), pages 399-416, December.
  31. Patrick Hummel, 2018. "How do selling mechanisms affect profits, surplus, capacity and prices with unknown demand?," Canadian Journal of Economics/Revue canadienne d'économique, John Wiley & Sons, vol. 51(1), pages 94-126, February.
  32. Dalalah, Doraid & Ojiako, Udechukwu & Chipulu, Maxwell, 2020. "Voluntary overbooking in commercial airline reservations," Journal of Air Transport Management, Elsevier, vol. 86(C).
  33. Edieal J. Pinker & Abraham Seidmann & Yaniv Vakrat, 2003. "Managing Online Auctions: Current Business and Research Issues," Management Science, INFORMS, vol. 49(11), pages 1457-1484, November.
  34. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
  35. Mukhopadhyay, Samar K. & Setaputra, Robert, 2007. "A dynamic model for optimal design quality and return policies," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1144-1154, August.
  36. Atul Bhandari & Nicola Secomandi, 2011. "TECHNICAL NOTE---Revenue Management with Bargaining," Operations Research, INFORMS, vol. 59(2), pages 498-506, April.
  37. Chen, Xi & Ghate, Archis & Tripathi, Arvind, 2011. "Dynamic lot-sizing in sequential online retail auctions," European Journal of Operational Research, Elsevier, vol. 215(1), pages 257-267, November.
  38. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
  39. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2019. "Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment," Operations Research, INFORMS, vol. 67(3), pages 711-730, May.
  40. Mallesh M. Pai & Rakesh Vohra, 2013. "Optimal Dynamic Auctions and Simple Index Rules," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 682-697, November.
  41. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2015. "Repeated Auctions with Budgets in Ad Exchanges: Approximations and Design," Management Science, INFORMS, vol. 61(4), pages 864-884, April.
  42. 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.
  43. Bahbouhi, Jalal Eddine & Moussa, Najem, 2017. "Prisoner’s dilemma game model for e-commerce," Applied Mathematics and Computation, Elsevier, vol. 292(C), pages 128-144.
  44. Gabriel Bitran & René Caldentey, 2003. "An Overview of Pricing Models for Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 5(3), pages 203-229, August.
  45. Yiwei Chen & Ming Hu, 2020. "Pricing and Matching with Forward-Looking Buyers and Sellers," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 717-734, July.
  46. Ayvaz-Cavdaroglu, Nur & Kachani, Soulaymane & Maglaras, Costis, 2016. "Revenue management with minimax regret negotiations," Omega, Elsevier, vol. 63(C), pages 12-22.
  47. Simon Stevenson & James Young, 2015. "The probability of sale and price premiums in withdrawn auctioned properties," Urban Studies, Urban Studies Journal Limited, vol. 52(2), pages 279-297, February.
  48. Ling‐Chieh Kung & Ying‐Ju Chen, 2011. "Monitoring the market or the salesperson? The value of information in a multilayer supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 743-762, December.
  49. Pinker, Edieal & Seidmann, Abraham & Vakrat, Yaniv, 2010. "Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations," European Journal of Operational Research, Elsevier, vol. 202(2), pages 574-583, April.
  50. Ron Lavi & Ella Segev, 2014. "Efficiency levels in sequential auctions with dynamic arrivals," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 791-819, November.
  51. Katehakis, Michael N. & Puranam, Kartikeya S., 2012. "On bidding for a fixed number of items in a sequence of auctions," European Journal of Operational Research, Elsevier, vol. 222(1), pages 76-84.
  52. Jiang, Zhong-Zhong & Fang, Shu-Cherng & Fan, Zhi-Ping & Wang, Dingwei, 2013. "Selecting optimal selling format of a product in B2C online auctions with boundedly rational customers," European Journal of Operational Research, Elsevier, vol. 226(1), pages 139-153.
  53. Patrick Hummel, 2018. "Reserve prices in repeated auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 273-299, March.
  54. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2012. "Auctions for Online Display Advertising Exchanges: Approximations and Design," Working Papers 12-11, NET Institute.
  55. Robert Zeithammer, 2007. "Research Note--Strategic Bid-Shading and Sequential Auctioning with Learning from Past Prices," Management Science, INFORMS, vol. 53(9), pages 1510-1519, September.
  56. Sun, Daewon, 2008. "Dual mechanism for an online retailer," European Journal of Operational Research, Elsevier, vol. 187(3), pages 903-921, June.
  57. Alex Gershkov & Benny Moldovanu & Philipp Strack, 2018. "Revenue-Maximizing Mechanisms with Strategic Customers and Unknown, Markovian Demand," Management Science, INFORMS, vol. 64(5), pages 2031-2046, May.
  58. Hoang, Lê Nguyên & Soumis, François & Zaccour, Georges, 2019. "The return function: A new computable perspective on Bayesian–Nash equilibria," European Journal of Operational Research, Elsevier, vol. 279(2), pages 471-485.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.