Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
Author
Abstract
Suggested Citation
DOI: 10.1287/mnsc.2022.4558
Download full text from publisher
References listed on IDEAS
- Susan Athey & Glenn Ellison, 2011.
"Position Auctions with Consumer Search,"
The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 126(3), pages 1213-1270.
- Susan Athey & Glenn Ellison, 2007. "Position Auctions with Consumer Search," Levine's Bibliography 122247000000001633, UCLA Department of Economics.
- Susan Athey & Glenn Ellison, 2009. "Position Auctions with Consumer Search," NBER Working Papers 15253, National Bureau of Economic Research, Inc.
- Ali Aouad & Danny Segev, 2021. "Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences," Management Science, INFORMS, vol. 67(6), pages 3519-3550, June.
- N. Vieille, 1992. "Weak Approachability," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 781-791, November.
- Alaei, Saeed & Hartline, Jason & Niazadeh, Rad & Pountourakis, Emmanouil & Yuan, Yang, 2019. "Optimal auctions vs. anonymous pricing," Games and Economic Behavior, Elsevier, vol. 118(C), pages 494-510.
- Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Dan Garber, 2021. "Efficient Online Linear Optimization with Approximation Algorithms," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 204-220, February.
- Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Milman, Emanuel, 2006. "Approachable sets of vector payoffs in stochastic games," Games and Economic Behavior, Elsevier, vol. 56(1), pages 135-147, July.
- Xavier Spinat, 2002. "A Necessary and Sufficient Condition for Approachability," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 31-44, February.
- A. Gürhan Kök & Marshall L. Fisher & Ramnath Vaidyanathan, 2008. "Assortment Planning: Review of Literature and Industry Practice," International Series in Operations Research & Management Science, in: Narendra Agrawal & Stephen A. Smith (ed.), Retail Supply Chain Management, chapter 0, pages 99-153, Springer.
- Jean-Yves Audibert & Sébastien Bubeck & Gábor Lugosi, 2014. "Regret in Online Combinatorial Optimization," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 31-45, February.
- Kris J. Ferreira & Sunanda Parthasarathy & Shreyas Sekar, 2022. "Learning to Rank an Assortment of Products," Management Science, INFORMS, vol. 68(3), pages 1828-1848, March.
- Antoine Désir & Vineet Goyal & Danny Segev & Chun Ye, 2020. "Constrained Assortment Optimization Under the Markov Chain–based Choice Model," Management Science, INFORMS, vol. 66(2), pages 698-721, February.
- Ehud Lehrer, 2003. "Approachability in infinite dimensional spaces," International Journal of Game Theory, Springer;Game Theory Society, vol. 31(2), pages 253-268.
- Nicolas Vieille, 1992. "Weak Approachability," Post-Print hal-00481891, HAL.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Fournier, Gaëtan & Kuperwasser, Eden & Munk, Orin & Solan, Eilon & Weinbaum, Avishay, 2021.
"Approachability with constraints,"
European Journal of Operational Research, Elsevier, vol. 292(2), pages 687-695.
- Gaëtan Fournier & Eden Kuperwasser & Orin Munk & Eilon Solan & Avishay Weinbaum, 2021. "Approachability with constraints," Post-Print hal-03138536, HAL.
- Çömez-Dolgan, Nagihan & Fescioglu-Unver, Nilgun & Cephe, Ecem & Şen, Alper, 2021. "Capacitated strategic assortment planning under explicit demand substitution," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1120-1138.
- Flesch, János & Laraki, Rida & Perchet, Vianney, 2018. "Approachability of convex sets in generalized quitting games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 411-431.
- Ehud Lehrer & Eilon Solan, 2006. "Excludability and Bounded Computational Capacity," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 637-648, August.
- Mohit Singh & Weijun Xie, 2020. "Approximation Algorithms for D -optimal Design," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1512-1534, November.
- Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
- Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
- Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
- Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
- Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 516-543, February.
- Joseph M. Abdou & Nikolaos Pnevmatikos, 2019.
"Asymptotic Value in Frequency-Dependent Games with Separable Payoffs: A Differential Approach,"
Dynamic Games and Applications, Springer, vol. 9(2), pages 295-313, June.
- Joseph Abdou & Nikolaos Pnevmatikos, 2016. "Asymptotic value in frequency-dependent games with separable payoffs: a differential approach," Documents de travail du Centre d'Economie de la Sorbonne 16076rr, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne, revised Jul 2018.
- Joseph M. Abdou & Nikolaos Pnevmatikos, 2018. "Asymptotic value in frequency-dependent games with separable payoffs: a differential approach," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01400267, HAL.
- Joseph M. Abdou & Nikolaos Pnevmatikos, 2018. "Asymptotic value in frequency-dependent games with separable payoffs: a differential approach," Post-Print halshs-01400267, HAL.
- Pierre Cardaliaguet & Catherine Rainer & Dinah Rosenberg & Nicolas Vieille, 2016. "Markov Games with Frequent Actions and Incomplete Information—The Limit Case," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 49-71, February.
- Mohammad Abouei Mehrizi & Federico Corò & Emilio Cruciani & Gianlorenzo D’Angelo, 2022. "Election control through social influence with voters’ uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 635-669, August.
- Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
- Suning Gong & Qingqin Nong & Shuyu Bao & Qizhi Fang & Ding-Zhu Du, 2023. "A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice," Journal of Global Optimization, Springer, vol. 85(1), pages 15-38, January.
- Emily M. Craparo & Mumtaz Karatas & Tobias U. Kuhn, 2017. "Sensor placement in active multistatic sonar networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 287-304, June.
- Sylvain Sorin, 2011. "Zero-Sum Repeated Games: Recent Advances and New Links with Differential Games," Dynamic Games and Applications, Springer, vol. 1(1), pages 172-207, March.
- Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
- Andrey Bernstein & Shie Mannor & Nahum Shimkin, 2014. "Opportunistic Approachability and Generalized No-Regret Problems," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1057-1083, November.
- Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
More about this item
Keywords
Blackwell approachability; offline-to-online; no regret; submodular maximization; product ranking; reserve price optimization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:69:y:2023:i:7:p:3797-3817. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.