Revenue Maximization Under Unknown Private Values with Nonobligatory Inspection

References

• Alaei S, Belloni A, Makhdoumi A, Malekian A (2024) Optimal auction design with deferred inspection and reward. Oper. Res., ePub ahead of print March 28, https://doi.org/10.1287/opre.2020.0651.Google Scholar
• Allon G, Bassamboo A (2011) Buying from the babbling retailer? The impact of availability information on customer behavior. Management Sci. 57(4):713–726.Link, Google Scholar
• Aouad A, Saritaç Ö (2022) Dynamic stochastic matching under limited time. Oper. Res. 70(4):2349–2383.Google Scholar
• Armstrong M, Zhou J (2016) Search deterrence. Rev. Econom. Stud. 83(1):26–57.Crossref, Google Scholar
• Arnosti N, Ma W (2023) Tight guarantees for static threshold policies in the prophet secretary problem. Oper. Res. 71(5):1777–1788.Link, Google Scholar
• Ashlagi I, Burq M, Jaillet P, Manshadi V (2019) On matching and thickness in heterogeneous dynamic markets. Oper. Res. 67(4):927–949.Abstract, Google Scholar
• Ashlagi I, Burq M, Dutta C, Jaillet P, Saberi A, Sholley C (2023) Edge weighted online windowed matching. Math. Oper. Res. 48(2):999–1016.Google Scholar
• Azar PD, Kleinberg R, Weinberg SM (2014) Prophet inequalities with limited information. Proc. 25th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1358–1377.Google Scholar
• Babaioff M, Gonczarowski YA, Nisan N (2021) The menu-size complexity of revenue approximation. Games Econom. Behav. 134:281–307.Crossref, Google Scholar
• Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. Proc. 18th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 434–443.Google Scholar
• Balseiro SR, Brown DB (2019) Approximations to stochastic dynamic programs via information relaxation duality. Oper. Res. 67(2):577–597.Abstract, Google Scholar
• Balseiro SR, Candogan O (2017) Optimal contracts for intermediaries in online advertising. Oper. Res. 65(4):878–896.Link, Google Scholar
• Balseiro SR, Brown DB, Chen C (2020) Dynamic pricing of relocating resources in large networks. Management Sci. 67(7):4075–4094.Link, Google Scholar
• Balseiro SR, Mirrokni VS, Leme RP (2018) Dynamic mechanisms with martingale utilities. Management Sci. 64(11):5062–5082.Link, Google Scholar
• Ben-Porath E, Dekel E, Lipman BL (2014) Optimal allocation with costly verification. Amer. Econom. Rev. 104(12):3779–3813.Crossref, Google Scholar
• Beyhaghi H, Kleinberg R (2019) Pandora’s problem with nonobligatory inspection. Proc. 2019 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 131–132.Google Scholar
• Boodaghians S, Fusco F, Lazos P, Leonardi S (2020) Pandora’s box problem with order constraints. Proc. 21st ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 439–458.Google Scholar
• Brown DB, Smith JE, Sun P (2010) Information relaxations and duality in stochastic dynamic programs. Oper. Res. 58(4-part-1):785–801.Link, Google Scholar
• Castro F, Nazerzadeh H, Yan C (2020) Matching queues with reneging: A product form solution. Queueing Systems 96:359–385.Crossref, Google Scholar
• Chawla S, Gergatsouli E, Teng Y, Tzamos C, Zhang R (2020) Pandora’s box with correlations: Learning and approximation. 2020 IEEE 61st Annual Sympos. Foundations Comput. Sci. (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 1214–1225.Google Scholar
• Chen QG, Beil DR, Duenyas I (2022) Procurement mechanisms with post-auction pre-award cost-reduction investigations. Oper. Res. 70(6):3054–3075.Google Scholar
• Correa J, Foncea P, Hoeksma R, Oosterwijk T, Vredeveld T (2019) Recent developments in prophet inequalities. ACM SIGecom Exchanges 17(1):61–70.Crossref, Google Scholar
• Crémer J, Khalil F (1992) Gathering information before signing a contract. Amer. Econom. Rev. 82(3):566–578.Google Scholar
• Crémer J, Spiegel Y, Zheng CZ (2009) Auctions with costly information acquisition. Econom. Theory 38(1):41–72.Crossref, Google Scholar
• Cui R, Shin H (2018) Sharing aggregate inventory information with customers: Strategic cross-selling and shortage reduction. Management Sci. 64(1):381–400.Link, Google Scholar
• Doval L (2018) Whether to open Pandora’s box. J. Econom. Theory 175:127–158.Crossref, Google Scholar
• Drakopoulos K, Jain S, Randhawa R (2021) Persuading customers to buy early: The value of personalized information provisioning. Management Sci. 67(2):828–853.Link, Google Scholar
• Dutting P, Feldman M, Kesselheim T, Lucier B (2020) Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs. SIAM J. Comput. 49(3):540–582.Crossref, Google Scholar
• Feldman M, Svensson O, Zenklusen R (2021) Online contention resolution schemes with applications to Bayesian selection problems. SIAM J. Comput. 50(2):255–300.Crossref, Google Scholar
• Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1/e. 2009 50th Annual IEEE Sympos. Foundations Comput. Sci. (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 117–126.Google Scholar
• Feng Y, Niazadeh R (2024) Batching and optimal multi-stage bipartite allocations. Management Sci., ePub ahead of print August 30, https://doi.org/10.1287/mnsc.2022.03698.Google Scholar
• Feng Y, Hartline J, Li Y (2023) Simple mechanisms for non-linear agents. Proc. 2023 Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 3802–3816.Google Scholar
• Gershkov A, Moldovanu B, Strack P, Zhang M (2021) A theory of auctions with endogenous valuations. J. Political Econom. 129(4):1011–1051.Crossref, Google Scholar
• Golrezaei N, Nazerzadeh H (2017) Auctions with dynamic costly information acquisition. Oper. Res. 65(1):130–144.Link, Google Scholar
• Golrezaei N, Nazerzadeh H, Randhawa R (2020) Dynamic pricing for heterogeneous time-sensitive customers. Manufacturing Service Oper. Management 22(3):562–581.Link, Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Haeupler B, Mirrokni VS, Zadimoghaddam M (2011) Online stochastic weighted matching: Improved approximation algorithms. Chen N, Elkind E, Koutsoupias E, eds. Proc. 7th Internat. Workshop Internet Network Econom. (Springer, Berlin), 170–181.Google Scholar
• Haghpanah N, Hartline J (2014) Multi-dimensional virtual values and second-degree price discrimination. Preprint, submitted April 4, https://arxiv.org/abs/1404.1341.Google Scholar
• Hart S, Nisan N (2017) Approximate revenue maximization with multiple items. J. Econom. Theory 172:313–347.Crossref, Google Scholar
• Hatfield JW, Kojima F, Kominers SD (2014) Strategy-proofness, investment efficiency, and marginal returns: An equivalence. Proc. 15th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 801–801.Google Scholar
• Iyer AV, Schwarz LB, Zenios SA (2005) A principal-agent model for product specification and production. Management Sci. 51(1):106–119.Link, Google Scholar
• Jaillet P, Lu X (2014) Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39(3):624–646.Link, Google Scholar
• Jiang J, Ma W, Zhang J (2023) Tightness without counterexamples: A new approach and new results for prophet inequalities. Proc. 24th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 909.Google Scholar
• Jiang J, Ma W, Zhang J (2024) Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack. Oper. Res., ePub ahead of print June 3, https://doi.org/10.1287/opre.2022.0309.Google Scholar
• Johari R, Kamble V, Kanoria Y (2021) Matching while learning. Oper. Res. 69(2):655–681.Link, Google Scholar
• Kleinberg R, Weinberg SM (2012) Matroid prophet inequalities. Proc. 44th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 123–136.Google Scholar
• Kleinberg J, Kleinberg R (2018) Delegated search approximates efficient search. Proc. 2018 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 287–302.Google Scholar
• Kleinberg R, Waggoner B, Weyl EG (2016) Descending price optimally coordinates search. Proc. 2016 ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 23–24.Google Scholar
• Krengel U, Sucheston L (1978) On semiamarts, amarts, and processes with finite value. Probability on Banach Spaces (Dekker, New York), 197–266.Google Scholar
• Li Y (2020) Mechanism design with costly verification and limited punishments. J. Econom. Theory 186:105000.Crossref, Google Scholar
• Lingenbrink D, Iyer K (2018) Signaling in online retail: Efficacy of public signals. Proc. 13th Workshop Econom. Networks Systems Comput. (Association for Computing Machinery, New York), 10.Google Scholar
• Lo I, Manshadi V, Rodilitz S, Shameli A (2024) Commitment on volunteer crowdsourcing platforms: Implications for growth and engagement. Manufacturing Service Oper. Management 26(5):1787–1805.Google Scholar
• Manshadi V, Rodilitz S (2022) Online policies for efficient volunteer crowdsourcing. Management Sci. 68(9):6572–6590.Google Scholar
• Manshadi VH, Gharan SO, Saberi A (2012) Online stochastic matching: Online actions based on offline statistics. Math. Oper. Res. 37(4):559–573.Link, Google Scholar
• Manshadi V, Niazadeh R, Rodilitz S (2021) Fair Dynamic Rationing (Association for Computing Machinery, New York), 694–695.Google Scholar
• Mensch J (2022) Screening inattentive buyers. Amer. Econom. Rev. 112(6):1949–1984.Crossref, Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Mylovanov T, Zapechelnyuk A (2017) Optimal allocation with ex post verification and limited penalties. Amer. Econom. Rev. 107(9):2666–2694.Crossref, Google Scholar
• Niazadeh R, Golrezaei N, Wang J, Susan F, Badanidiyuru A (2022) Online learning via offline greedy: Applications in market design and optimization. Management Sci. 69(7):3797–3817.Google Scholar
• Pancs R (2013) Sequential negotiations with costly information acquisition. Games Econom. Behav. 82:522–543.Crossref, Google Scholar
• Segev D, Singla S (2021) Efficient approximation schemes for stochastic probing and prophet problems. Proc. 22nd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 793–794.Google Scholar
• Shi X (2012) Optimal auctions with information acquisition. Games Econom. Behav. 74(2):666–686.Crossref, Google Scholar
• Stein C, Truong VA, Wang X (2020) Advance service reservations with heterogeneous customers. Management Sci. 66(7):2929–2950.Link, Google Scholar
• Szalay D (2009) Contracts with endogenous information. Games Econom. Behav. 65(2):586–625.Crossref, Google Scholar
• Truong VA, Wang X (2019) Prophet inequality with correlated arrival probabilities, with application to two sided matchings. Preprint, submitted January 8, https://arxiv.org/abs/1901.02552.Google Scholar
• Wan Z, Beil DR (2009) RFQ auctions with supplier qualification screening. Oper. Res. 57(4):934–949.Link, Google Scholar
• Wan Z, Beil DR, Katok E (2012) When does it pay to delay supplier qualification? Theory and experiments. Management Sci. 58(11):2057–2075.Link, Google Scholar
• Weitzman ML (1979) Optimal search for the best alternative. Econometrica 47(3):641–654.Crossref, Google Scholar
• Yan Q (2011) Mechanism design via correlation gap. Proc. 22nd Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 710–719.Google Scholar
• Ye L (2007) Indicative bidding and a theory of two-stage auctions. Games Econom. Behav. 58(1):181–207.Crossref, Google Scholar