Balseiro, Santiago R.; Lu, Haihao; Mirrokni, Vahab The best of many worlds: dual mirror descent for online allocation problems. (English) Zbl 07809597 Oper. Res. 71, No. 1, 101-119 (2023). MSC: 90B06 91B32 PDFBibTeX XMLCite \textit{S. R. Balseiro} et al., Oper. Res. 71, No. 1, 101--119 (2023; Zbl 07809597) Full Text: DOI arXiv
Li, Sarah H. Q.; Yu, Yue; Miguel, Nicolas I.; Calderone, Dan; Ratliff, Lillian J.; Açıkmeşe, Behçet Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks. (English) Zbl 1520.91043 Automatica 151, Article ID 110879, 8 p. (2023). MSC: 91A14 91A15 90C40 90B06 PDFBibTeX XMLCite \textit{S. H. Q. Li} et al., Automatica 151, Article ID 110879, 8 p. (2023; Zbl 1520.91043) Full Text: DOI arXiv
Soma, Tasuku; Yoshida, Yuichi Online risk-averse submodular maximization. (English) Zbl 1512.91176 Ann. Oper. Res. 320, No. 1, 393-414 (2023). MSC: 91G70 93E20 68W27 PDFBibTeX XMLCite \textit{T. Soma} and \textit{Y. Yoshida}, Ann. Oper. Res. 320, No. 1, 393--414 (2023; Zbl 1512.91176) Full Text: DOI arXiv
Chok, James; Vasil, Geoffrey M. Convex optimization over a probability simplex. arXiv:2305.09046 Preprint, arXiv:2305.09046 [math.OC] (2023). MSC: 65K10 68W27 68W40 91G10 97U40 BibTeX Cite \textit{J. Chok} and \textit{G. M. Vasil}, ``Convex optimization over a probability simplex'', Preprint, arXiv:2305.09046 [math.OC] (2023) Full Text: arXiv OA License
Chassang, Sylvain; Kapon, Samuel Prior-free dynamic allocation under limited liability. (English) Zbl 07759615 Theor. Econ. 17, No. 3, 1109-1143 (2022). MSC: 91B32 91B03 PDFBibTeX XMLCite \textit{S. Chassang} and \textit{S. Kapon}, Theor. Econ. 17, No. 3, 1109--1143 (2022; Zbl 07759615) Full Text: DOI OA License
Gravin, Nick; Li, Hao; Tang, Zhihao Gavin Optimal prophet inequality with less than one sample. (English) Zbl 07722941 Hansen, Kristoffer Arnsfelt (ed.) et al., Web and internet economics. 18th international conference, WINE 2022, Troy, NY, USA, December 12–15, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13778, 115-131 (2022). MSC: 68M11 91A80 91B26 PDFBibTeX XMLCite \textit{N. Gravin} et al., Lect. Notes Comput. Sci. 13778, 115--131 (2022; Zbl 07722941) Full Text: DOI
Ena, Borja; Gomez, Alberto; Ponte, Borja; Priore, Paolo; Diaz, Diego Homogeneous grouping of non-prime steel products for online auctions: a case study. (English) Zbl 1496.90073 Ann. Oper. Res. 315, No. 1, 591-621 (2022). MSC: 90C27 91B26 PDFBibTeX XMLCite \textit{B. Ena} et al., Ann. Oper. Res. 315, No. 1, 591--621 (2022; Zbl 1496.90073) Full Text: DOI
Ahmed, Asrar; Sohoni, Milind G.; Bandi, Chaithanya Parameterized approximations for the two-sided assortment optimization. (English) Zbl 1525.91122 Oper. Res. Lett. 50, No. 4, 399-406 (2022). MSC: 91B68 PDFBibTeX XMLCite \textit{A. Ahmed} et al., Oper. Res. Lett. 50, No. 4, 399--406 (2022; Zbl 1525.91122) Full Text: DOI
Feng, Xin; Chu, Chengbin Online leasing problem with price fluctuations and the second-hand transaction. (English) Zbl 1497.91121 J. Comb. Optim. 43, No. 5, 1280-1297 (2022). MSC: 91B24 90C27 PDFBibTeX XMLCite \textit{X. Feng} and \textit{C. Chu}, J. Comb. Optim. 43, No. 5, 1280--1297 (2022; Zbl 1497.91121) Full Text: DOI
Papadimitriou, Christos; Vodrahalli, Kiran; Yannakakis, Mihalis The platform design problem. (English) Zbl 07553931 Feldman, Michal (ed.) et al., Web and internet economics. 17th international conference, WINE 2021, Potsdam, Germany, December 14–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13112, 317-333 (2022). MSC: 68M11 91A80 91B26 PDFBibTeX XMLCite \textit{C. Papadimitriou} et al., Lect. Notes Comput. Sci. 13112, 317--333 (2022; Zbl 07553931) Full Text: DOI arXiv
Ngerng, Miang Hong; Ngerng, Sherilynn S. F. Portfolio selection algorithm under financial crisis: a case study with Bursa Malaysia. (English) Zbl 07545881 Commun. Stat., Simulation Comput. 51, No. 5, 2586-2598 (2022). MSC: 91B28 PDFBibTeX XMLCite \textit{M. H. Ngerng} and \textit{S. S. F. Ngerng}, Commun. Stat., Simulation Comput. 51, No. 5, 2586--2598 (2022; Zbl 07545881) Full Text: DOI
Bateni, Mohammadhossein; Chen, Yiwei; Ciocan, Dragos Florin; Mirrokni, Vahab Fair resource allocation in a volatile marketplace. (English) Zbl 1484.91219 Oper. Res. 70, No. 1, 288-308 (2022). MSC: 91B32 90B60 PDFBibTeX XMLCite \textit{M. Bateni} et al., Oper. Res. 70, No. 1, 288--308 (2022; Zbl 1484.91219) Full Text: DOI
Yamim, J. D. M.; Borges, C. C. H.; Neto, R. F. Online portfolio optimization with risk control. (English) Zbl 07773048 Trends Comput. Appl. Math. 22, No. 3, 475-493 (2021). MSC: 91G10 PDFBibTeX XMLCite \textit{J. D. M. Yamim} et al., Trends Comput. Appl. Math. 22, No. 3, 475--493 (2021; Zbl 07773048) Full Text: DOI
Ren, Long; Zhu, Bin; Xu, Zeshui Robust consumer preference analysis with a social network. (English) Zbl 07763330 Inf. Sci. 566, 379-400 (2021). MSC: 91B42 91B10 91D30 90C17 PDFBibTeX XMLCite \textit{L. Ren} et al., Inf. Sci. 566, 379--400 (2021; Zbl 07763330) Full Text: DOI
Im, Sungjin; Moseley, Benjamin; Zhou, Rudy The matroid cup game. (English) Zbl 1525.91002 Oper. Res. Lett. 49, No. 3, 405-411 (2021). MSC: 91A05 05B35 68W27 90C27 91A80 91B32 PDFBibTeX XMLCite \textit{S. Im} et al., Oper. Res. Lett. 49, No. 3, 405--411 (2021; Zbl 1525.91002) Full Text: DOI
Medvedeva, Marina A.; Katsikis, Vasilios N.; Mourtas, Spyridon D.; Simos, Theodore E. Randomized time-varying knapsack problems via binary beetle antennae search algorithm: emphasis on applications in portfolio insurance. (English) Zbl 1512.90198 Math. Methods Appl. Sci. 44, No. 2, 2002-2012 (2021). MSC: 90C27 68W27 68W50 90C10 90C59 91G10 PDFBibTeX XMLCite \textit{M. A. Medvedeva} et al., Math. Methods Appl. Sci. 44, No. 2, 2002--2012 (2021; Zbl 1512.90198) Full Text: DOI
Vera, Alberto; Banerjee, Siddhartha; Gurvich, Itai Online allocation and pricing: constant regret via Bellman inequalities. (English) Zbl 1469.90085 Oper. Res. 69, No. 3, 821-840 (2021). MSC: 90B50 90C39 91B32 91B24 PDFBibTeX XMLCite \textit{A. Vera} et al., Oper. Res. 69, No. 3, 821--840 (2021; Zbl 1469.90085) Full Text: DOI arXiv
Kanoria, Yash; Nazerzadeh, Hamid Incentive-compatible learning of reserve prices for repeated auctions. (English) Zbl 1478.91089 Oper. Res. 69, No. 2, 509-524 (2021). Reviewer: Tamás Mátrai (Edinburgh) MSC: 91B26 90B60 PDFBibTeX XMLCite \textit{Y. Kanoria} and \textit{H. Nazerzadeh}, Oper. Res. 69, No. 2, 509--524 (2021; Zbl 1478.91089) Full Text: DOI
Garber, Dan Efficient online linear optimization with approximation algorithms. (English) Zbl 1511.68220 Math. Oper. Res. 46, No. 1, 204-220 (2021). MSC: 68T05 68W25 68W27 90C05 90C59 91A26 PDFBibTeX XMLCite \textit{D. Garber}, Math. Oper. Res. 46, No. 1, 204--220 (2021; Zbl 1511.68220) Full Text: DOI arXiv
Altschuler, Jason M.; Talwar, Kunal Online learning over a finite action set with limited switching. (English) Zbl 1511.68218 Math. Oper. Res. 46, No. 1, 179-203 (2021). MSC: 68T05 68T37 68W27 90C27 91A26 91B06 PDFBibTeX XMLCite \textit{J. M. Altschuler} and \textit{K. Talwar}, Math. Oper. Res. 46, No. 1, 179--203 (2021; Zbl 1511.68218) Full Text: DOI arXiv
Xu, Jianyu; Chen, Lujie; Tang, Ou An online algorithm for the risk-aware restless bandit. (English) Zbl 1487.90634 Eur. J. Oper. Res. 290, No. 2, 622-639 (2021). MSC: 90C40 91G70 PDFBibTeX XMLCite \textit{J. Xu} et al., Eur. J. Oper. Res. 290, No. 2, 622--639 (2021; Zbl 1487.90634) Full Text: DOI
Li, Ao; Wan, Zhaoman; Wan, Zhong Optimal design of online sequential buy-price auctions with consumer valuation learning. (English) Zbl 1457.91193 Asia-Pac. J. Oper. Res. 37, No. 3, Article ID 2050012, 26 p. (2020). MSC: 91B26 90C39 PDFBibTeX XMLCite \textit{A. Li} et al., Asia-Pac. J. Oper. Res. 37, No. 3, Article ID 2050012, 26 p. (2020; Zbl 1457.91193) Full Text: DOI
Huang, Song; Ni, Xuanming; Qian, Long; Zhang, Junchao Large-dimensional online portfolio strategy based on ensemble learning. (Chinese. English summary) Zbl 1463.91127 J. Syst. Sci. Math. Sci. 40, No. 1, 29-40 (2020). MSC: 91G10 68T05 PDFBibTeX XMLCite \textit{S. Huang} et al., J. Syst. Sci. Math. Sci. 40, No. 1, 29--40 (2020; Zbl 1463.91127)
Brubach, Brian; Sankararaman, Karthik Abinav; Srinivasan, Aravind; Xu, Pan Online stochastic matching: new algorithms and bounds. (English) Zbl 1455.68277 Algorithmica 82, No. 10, 2737-2783 (2020). MSC: 68W27 68W20 90B60 90C15 90C27 91B68 PDFBibTeX XMLCite \textit{B. Brubach} et al., Algorithmica 82, No. 10, 2737--2783 (2020; Zbl 1455.68277) Full Text: DOI arXiv
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit Online submodular maximization: beating 1/2 made simple. (English) Zbl 1453.68215 Math. Program. 183, No. 1-2 (B), 149-169 (2020). MSC: 68W27 90C27 90C30 91B26 PDFBibTeX XMLCite \textit{N. Buchbinder} et al., Math. Program. 183, No. 1--2 (B), 149--169 (2020; Zbl 1453.68215) Full Text: DOI arXiv
Haverkort, Herman; Kübel, David; Langetepe, Elmar; Schwarzwald, Barbara How to play hot and cold. (English) Zbl 1433.68112 Comput. Geom. 87, Article ID 101596, 11 p. (2020). MSC: 68P10 68U05 90C27 91A80 PDFBibTeX XMLCite \textit{H. Haverkort} et al., Comput. Geom. 87, Article ID 101596, 11 p. (2020; Zbl 1433.68112) Full Text: DOI
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit Online submodular maximization: beating 1/2 made simple. (English) Zbl 1436.90134 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 20th international conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11480, 101-114 (2019). MSC: 90C30 91B26 PDFBibTeX XMLCite \textit{N. Buchbinder} et al., Lect. Notes Comput. Sci. 11480, 101--114 (2019; Zbl 1436.90134) Full Text: DOI arXiv
Slivkins, Aleksandrs Introduction to multi-armed bandits. (English) Zbl 1478.68006 Found. Trends Mach. Learn. 12, No. 1-2, 1-296 (2019). Reviewer: Christopher Policastro (New York) MSC: 68-01 60-01 60G40 68T05 68W20 68W27 91A20 91A26 91A60 PDFBibTeX XMLCite \textit{A. Slivkins}, Found. Trends Mach. Learn. 12, No. 1--2, 1--296 (2019; Zbl 1478.68006) Full Text: DOI arXiv
Kleinberg, Robert; Weinberg, S. Matthew Matroid prophet inequalities and applications to multi-dimensional mechanism design. (English) Zbl 1419.91332 Games Econ. Behav. 113, 97-115 (2019). MSC: 91B26 93E20 05B35 PDFBibTeX XMLCite \textit{R. Kleinberg} and \textit{S. M. Weinberg}, Games Econ. Behav. 113, 97--115 (2019; Zbl 1419.91332) Full Text: DOI
Devanur, Nikhil R.; Jain, Kamal; Sivan, Balasubramanian; Wilkens, Christopher A. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. (English) Zbl 1427.91142 J. ACM 66, No. 1, Article No. 7, 41 p. (2019). MSC: 91B32 68W25 68W27 90C27 PDFBibTeX XMLCite \textit{N. R. Devanur} et al., J. ACM 66, No. 1, Article No. 7, 41 p. (2019; Zbl 1427.91142) Full Text: DOI arXiv
Kobzar, Vladimir A.; Kohn, Robert V.; Wang, Zhilei New Potential-Based Bounds for the Geometric-Stopping Version of Prediction with Expert Advice. arXiv:1912.03132 Preprint, arXiv:1912.03132 [cs.LG] (2019). MSC: 35Q93 35Q68 49L20 68W27 91A05 93C20 BibTeX Cite \textit{V. A. Kobzar} et al., ``New Potential-Based Bounds for the Geometric-Stopping Version of Prediction with Expert Advice'', Preprint, arXiv:1912.03132 [cs.LG] (2019) Full Text: arXiv OA License
Kobzar, Vladimir A.; Kohn, Robert V.; Wang, Zhilei New Potential-Based Bounds for Prediction with Expert Advice. arXiv:1911.01641 Preprint, arXiv:1911.01641 [cs.LG] (2019). MSC: 35Q93 35Q68 49L20 68W27 91A05 93C20 BibTeX Cite \textit{V. A. Kobzar} et al., ``New Potential-Based Bounds for Prediction with Expert Advice'', Preprint, arXiv:1911.01641 [cs.LG] (2019) Full Text: arXiv OA License
Kohayakawa, Yoshiharu; Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. (English) Zbl 1504.68291 Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 697-711 (2018). MSC: 68W27 68Q17 90C27 91A43 PDFBibTeX XMLCite \textit{Y. Kohayakawa} et al., Lect. Notes Comput. Sci. 10807, 697--711 (2018; Zbl 1504.68291) Full Text: DOI arXiv
Li, Chao; Yuan, Jing; Du, Ding-Zhu Social influence-based optimization problems. (English) Zbl 1421.90153 Pardalos, Panos M. (ed.) et al., Open problems in optimization and data analysis. Based on the summer school on challenges and open problems in optimization and data science, Deucalion Summer Institute for Advanced Studies in Optimization, Mathematics, and Data Science, Greece, August 2016. Cham: Springer. Springer Optim. Appl. 141, 9-22 (2018). MSC: 90C35 91D30 90C59 PDFBibTeX XMLCite \textit{C. Li} et al., Springer Optim. Appl. 141, 9--22 (2018; Zbl 1421.90153) Full Text: DOI
Korula, Nitish; Mirrokni, Vahab; Zadimoghaddam, Morteza Online submodular welfare maximization: greedy beats 1/2 in random order. (English) Zbl 1397.91265 SIAM J. Comput. 47, No. 3, 1056-1086 (2018). MSC: 91B26 68W27 90C27 PDFBibTeX XMLCite \textit{N. Korula} et al., SIAM J. Comput. 47, No. 3, 1056--1086 (2018; Zbl 1397.91265) Full Text: DOI arXiv
Xu, Qi; Wang, Wen-Jie; Liu, Zheng; Tong, Pan The influence of online subsidies service on online-to-offline supply chain. (English) Zbl 1394.90143 Asia-Pac. J. Oper. Res. 35, No. 2, Article ID 1840007, 18 p. (2018). MSC: 90B06 90B05 91B42 PDFBibTeX XMLCite \textit{Q. Xu} et al., Asia-Pac. J. Oper. Res. 35, No. 2, Article ID 1840007, 18 p. (2018; Zbl 1394.90143) Full Text: DOI
Hoefer, Martin; Kodric, Bojana Combinatorial secretary problems with ordinal information. (English) Zbl 1442.68277 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 133, 14 p. (2017). MSC: 68W27 05B35 68W40 90C27 91B06 PDFBibTeX XMLCite \textit{M. Hoefer} and \textit{B. Kodric}, LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 133, 14 p. (2017; Zbl 1442.68277) Full Text: DOI arXiv
Nakhe, Paresh Dynamic pricing in competitive markets. (English) Zbl 1405.91210 Devanur, Nikhil R. (ed.) et al., Web and internet economics. 13th international conference, WINE 2017, Bangalore, India, December 17–20, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-71923-8/pbk; 978-3-319-71924-5/ebook). Lecture Notes in Computer Science 10660, 354-367 (2017). MSC: 91B24 90C25 91A26 PDFBibTeX XMLCite \textit{P. Nakhe}, Lect. Notes Comput. Sci. 10660, 354--367 (2017; Zbl 1405.91210) Full Text: DOI arXiv
Feldman, Moran; Izsak, Rani Building a good team: secretary problems and the supermodular degree. (English) Zbl 1422.68338 Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1651-1670 (2017). MSC: 68W40 05B35 68W27 90C27 91A60 PDFBibTeX XMLCite \textit{M. Feldman} and \textit{R. Izsak}, in: Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16--19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1651--1670 (2017; Zbl 1422.68338) Full Text: DOI arXiv
Marcastel, Alexandre; Belmega, E. Veronica; Mertikopoulos, Panayotis; Fijalkow, Inbar Interference mitigation via pricing in time-varying cognitive radio systems. (English) Zbl 1430.91042 Lasaulce, Samson (ed.) et al., Network games, control, and optimization. Proceedings of NETGCOOP 2016, Avignon, France, November 23–25, 2016. Basel: Birkhäuser/Springer. Static Dyn. Game Theory: Found. Appl., 177-186 (2017). MSC: 91B24 94A05 PDFBibTeX XMLCite \textit{A. Marcastel} et al., in: Network games, control, and optimization. Proceedings of NETGCOOP 2016, Avignon, France, November 23--25, 2016. Basel: Birkhäuser/Springer. 177--186 (2017; Zbl 1430.91042) Full Text: DOI HAL
Haverkort, Herman; Kübel, David; Langetepe, Elmar; Schwarzwald, Barbara How to play hot and cold on a line. (English) Zbl 1491.68055 Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 449-460 (2017). MSC: 68P10 90C27 91A80 PDFBibTeX XMLCite \textit{H. Haverkort} et al., Lect. Notes Comput. Sci. 10389, 449--460 (2017; Zbl 1491.68055) Full Text: DOI
Bubeck, Sébastien; Lee, Yin Tat; Eldan, Ronen Kernel-based methods for bandit convex optimization. (English) Zbl 1370.90175 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 72-85 (2017). MSC: 90C25 68Q25 68T05 91A60 PDFBibTeX XMLCite \textit{S. Bubeck} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 72--85 (2017; Zbl 1370.90175) Full Text: DOI arXiv
Hazan, Elad; Koren, Tomer The computational power of optimization in online learning. (English) Zbl 1373.68456 Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 128-141 (2016). MSC: 68W27 68Q17 68T05 68T20 90C59 91A26 PDFBibTeX XMLCite \textit{E. Hazan} and \textit{T. Koren}, in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 128--141 (2016; Zbl 1373.68456) Full Text: DOI arXiv
Zhang, Wenming; Zhang, E.; Zheng, Feifeng Online two stage \(k\)-search problem and its competitive analysis. (English) Zbl 1351.68313 Int. J. Found. Comput. Sci. 27, No. 6, 653-663 (2016). MSC: 68W27 90C59 91B25 91B84 PDFBibTeX XMLCite \textit{W. Zhang} et al., Int. J. Found. Comput. Sci. 27, No. 6, 653--663 (2016; Zbl 1351.68313) Full Text: DOI
Neu, Gergely; Bartók, Gábor Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits. (English) Zbl 1392.68359 J. Mach. Learn. Res. 17, Paper No. 154, 21 p. (2016). MSC: 68T05 62C05 62L10 90C27 91A60 PDFBibTeX XMLCite \textit{G. Neu} and \textit{G. Bartók}, J. Mach. Learn. Res. 17, Paper No. 154, 21 p. (2016; Zbl 1392.68359) Full Text: arXiv Link
Shimkin, Nahum An online convex optimization approach to Blackwell’s approachability. (English) Zbl 1394.91035 J. Mach. Learn. Res. 17, Paper No. 129, 23 p. (2016). MSC: 91A20 68W27 90C25 PDFBibTeX XMLCite \textit{N. Shimkin}, J. Mach. Learn. Res. 17, Paper No. 129, 23 p. (2016; Zbl 1394.91035) Full Text: arXiv Link
Legrain, Antoine; Jaillet, Patrick A stochastic algorithm for online bipartite resource allocation problems. (English) Zbl 1349.90659 Comput. Oper. Res. 75, 28-37 (2016). MSC: 90C15 91B32 68W27 90C10 PDFBibTeX XMLCite \textit{A. Legrain} and \textit{P. Jaillet}, Comput. Oper. Res. 75, 28--37 (2016; Zbl 1349.90659) Full Text: DOI
Bujtás, Cs.; Dósa, Gy.; Imreh, Cs.; Nagy-György, J.; Tuza, Zs. New models of graph-bin packing. (English) Zbl 1345.68277 Theor. Comput. Sci. 640, 94-103 (2016). MSC: 68W27 90C27 91A46 PDFBibTeX XMLCite \textit{Cs. Bujtás} et al., Theor. Comput. Sci. 640, 94--103 (2016; Zbl 1345.68277) Full Text: DOI
Tyagi, Hemant; Stich, Sebastian U.; Gärtner, Bernd On two continuum armed bandit problems in high dimensions. (English) Zbl 1414.91084 Theory Comput. Syst. 58, No. 1, 191-222 (2016). MSC: 91A60 68W27 PDFBibTeX XMLCite \textit{H. Tyagi} et al., Theory Comput. Syst. 58, No. 1, 191--222 (2016; Zbl 1414.91084) Full Text: DOI Link
Kawase, Yasushi The secretary problem with a choice function. (English) Zbl 1472.68212 Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9472, 129-139 (2015). MSC: 68W20 60G40 68W27 90C27 91B06 PDFBibTeX XMLCite \textit{Y. Kawase}, Lect. Notes Comput. Sci. 9472, 129--139 (2015; Zbl 1472.68212) Full Text: DOI
Dütting, Paul; Kleinberg, Robert Polymatroid prophet inequalities. (English) Zbl 1466.68087 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 437-449 (2015). MSC: 68W27 90C27 91B03 91B26 91B44 PDFBibTeX XMLCite \textit{P. Dütting} and \textit{R. Kleinberg}, Lect. Notes Comput. Sci. 9294, 437--449 (2015; Zbl 1466.68087) Full Text: DOI arXiv
Korula, Nitish; Mirrokni, Vahab; Zadimoghaddam, Morteza Online submodular welfare maximization: greedy beats 1/2 in random order. (English) Zbl 1322.91031 Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 889-898 (2015). MSC: 91B15 91B26 91B32 90C90 68W27 PDFBibTeX XMLCite \textit{N. Korula} et al., in: Proceedings of the 47th annual ACM symposium on theory of computing, STOC '15, Portland, OR, USA, June 14--17, 2015. New York, NY: Association for Computing Machinery (ACM). 889--898 (2015; Zbl 1322.91031) Full Text: DOI
Gasnikov, A. V.; Nesterov, Yu. E.; Spokoiny, V. G. On the efficiency of a randomized mirror descent algorithm in online optimization problems. (English. Russian original) Zbl 1350.90027 Comput. Math. Math. Phys. 55, No. 4, 580-596 (2015); translation from Zh. Vychisl. Mat. Mat. Fiz. 55, No. 4, 582-598 (2015). MSC: 90C15 91A05 PDFBibTeX XMLCite \textit{A. V. Gasnikov} et al., Comput. Math. Math. Phys. 55, No. 4, 580--596 (2015; Zbl 1350.90027); translation from Zh. Vychisl. Mat. Mat. Fiz. 55, No. 4, 582--598 (2015) Full Text: DOI
Bilò, Davide; Bilò, Vittorio New bounds for the balloon popping problem. (English) Zbl 1328.90121 J. Comb. Optim. 29, No. 1, 182-196 (2015). MSC: 90C27 91B26 90C59 PDFBibTeX XMLCite \textit{D. Bilò} and \textit{V. Bilò}, J. Comb. Optim. 29, No. 1, 182--196 (2015; Zbl 1328.90121) Full Text: DOI
Hazan, Elad; Kale, Satyen An online portfolio selection algorithm with regret logarithmic in price variation. (English) Zbl 1312.91081 Math. Finance 25, No. 2, 288-310 (2015). MSC: 91G10 90C25 91G60 PDFBibTeX XMLCite \textit{E. Hazan} and \textit{S. Kale}, Math. Finance 25, No. 2, 288--310 (2015; Zbl 1312.91081) Full Text: DOI
Shen, Yilin; Dinh, Thang N.; Thai, My T.; Nguyen, Hien T. Staying safe and visible via message sharing in online social networks. (English) Zbl 1304.90178 J. Comb. Optim. 28, No. 1, 186-217 (2014). MSC: 90C27 91D30 90C59 PDFBibTeX XMLCite \textit{Y. Shen} et al., J. Comb. Optim. 28, No. 1, 186--217 (2014; Zbl 1304.90178) Full Text: DOI
Tyagi, Hemant; Gärtner, Bernd Continuum armed bandit problem of few variables in high dimensions. (English) Zbl 1422.91165 Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5–6, 2013. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8447, 108-119 (2014). MSC: 91A60 68W27 PDFBibTeX XMLCite \textit{H. Tyagi} and \textit{B. Gärtner}, Lect. Notes Comput. Sci. 8447, 108--119 (2014; Zbl 1422.91165) Full Text: DOI arXiv
Audibert, Jean-Yves; Bubeck, Sébastien; Lugosi, Gábor Regret in online combinatorial optimization. (English) Zbl 1341.68309 Math. Oper. Res. 39, No. 1, 31-45 (2014). MSC: 68W27 90C27 91A60 91B06 PDFBibTeX XMLCite \textit{J.-Y. Audibert} et al., Math. Oper. Res. 39, No. 1, 31--45 (2014; Zbl 1341.68309) Full Text: DOI arXiv
Munos, Rémi From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning. (English) Zbl 1296.91086 Found. Trends Mach. Learn. 7, No. 1, 1-129 (2014). MSC: 91B06 90C06 90C40 90C27 90B50 90C15 65C05 60G40 68T05 PDFBibTeX XMLCite \textit{R. Munos}, Found. Trends Mach. Learn. 7, No. 1, 1--129 (2014; Zbl 1296.91086) Full Text: DOI
Kapralov, Michael; Post, Ian; Vondrák, Jan Online submodular welfare maximization: greedy is optimal. (English) Zbl 1425.91198 Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1216-1225 (2013). MSC: 91B26 68W27 90C27 91B15 91B32 PDFBibTeX XMLCite \textit{M. Kapralov} et al., in: Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6--8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1216--1225 (2013; Zbl 1425.91198) Full Text: DOI arXiv
Bateni, Mohammadhossein; Hajiaghayi, Mohammadtaghi; Zadimoghaddam, Morteza Submodular secretary problem and extensions. (English) Zbl 1301.91016 ACM Trans. Algorithms 9, No. 4, Article No. 32, 23 p. (2013). MSC: 91B26 68W27 90C27 PDFBibTeX XMLCite \textit{M. Bateni} et al., ACM Trans. Algorithms 9, No. 4, Article No. 32, 23 p. (2013; Zbl 1301.91016) Full Text: DOI Link
Kawase, Yasushi; Han, Xin; Makino, Kazuhisa Unit cost buyback problem. (English) Zbl 1407.91127 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8283, 435-445 (2013). MSC: 91B26 68W27 90C27 91B60 PDFBibTeX XMLCite \textit{Y. Kawase} et al., Lect. Notes Comput. Sci. 8283, 435--445 (2013; Zbl 1407.91127) Full Text: DOI
Marini, Claudia; Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich Strategies in competing subset selection. (English) Zbl 1272.91017 Ann. Oper. Res. 207, 181-200 (2013). MSC: 91A10 91A05 91A46 90C27 PDFBibTeX XMLCite \textit{C. Marini} et al., Ann. Oper. Res. 207, 181--200 (2013; Zbl 1272.91017) Full Text: DOI
Hazan, Elad; Kale, Satyen Online submodular minimization. (English) Zbl 1433.68347 J. Mach. Learn. Res. 13, 2903-2922 (2012). MSC: 68T05 68W27 90C27 91A20 PDFBibTeX XMLCite \textit{E. Hazan} and \textit{S. Kale}, J. Mach. Learn. Res. 13, 2903--2922 (2012; Zbl 1433.68347) Full Text: Link
Bubeck, Sébastien; Cesa-Bianchi, Nicolò Regret analysis of stochastic and nonstochastic multi-armed bandit problems. (English) Zbl 1281.91051 Found. Trends Mach. Learn. 5, No. 1, 1-122 (2012). MSC: 91A60 91A26 91A35 91-02 62L05 62C20 90C40 68T05 PDFBibTeX XMLCite \textit{S. Bubeck} and \textit{N. Cesa-Bianchi}, Found. Trends Mach. Learn. 5, No. 1, 1--122 (2012; Zbl 1281.91051) Full Text: DOI arXiv
Barman, Siddharth; Umboh, Seeun; Chawla, Shuchi; Malec, David Secretary problems with convex costs. (English) Zbl 1272.91067 Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 75-87 (2012). MSC: 91B32 68W27 90C27 PDFBibTeX XMLCite \textit{S. Barman} et al., Lect. Notes Comput. Sci. 7391, 75--87 (2012; Zbl 1272.91067) Full Text: DOI arXiv
Cesa-Bianchi, Nicolò; Lugosi, Gábor Combinatorial bandits. (English) Zbl 1262.91052 J. Comput. Syst. Sci. 78, No. 5, 1404-1422 (2012). MSC: 91B06 62M20 PDFBibTeX XMLCite \textit{N. Cesa-Bianchi} and \textit{G. Lugosi}, J. Comput. Syst. Sci. 78, No. 5, 1404--1422 (2012; Zbl 1262.91052) Full Text: DOI
Langetepe, Elmar Searching for an axis-parallel shoreline. (English) Zbl 1286.68468 Theor. Comput. Sci. 447, 85-99 (2012). MSC: 68U05 90C27 68W27 91A80 PDFBibTeX XMLCite \textit{E. Langetepe}, Theor. Comput. Sci. 447, 85--99 (2012; Zbl 1286.68468) Full Text: DOI
Bubeck, Sébastien; Munos, Rémi; Stoltz, Gilles; Szepesvári, Csaba \(X\)-armed bandits. (English) Zbl 1280.91038 J. Mach. Learn. Res. 12, 1655-1695 (2011). MSC: 91A60 68T05 90C15 90C40 91B06 49K35 PDFBibTeX XMLCite \textit{S. Bubeck} et al., J. Mach. Learn. Res. 12, 1655--1695 (2011; Zbl 1280.91038) Full Text: Link
Fujiwara, Hiroshi; Kitano, Takuma; Fujito, Toshihiro On the best possible competitive ratio for multislope ski rental. (English) Zbl 1350.68306 Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 544-553 (2011). MSC: 68W40 68W27 90C27 91A40 PDFBibTeX XMLCite \textit{H. Fujiwara} et al., Lect. Notes Comput. Sci. 7074, 544--553 (2011; Zbl 1350.68306) Full Text: DOI
Langetepe, Elmar Searching for an axis-parallel shoreline. (English) Zbl 1310.68206 Wu, Weili (ed.) et al., Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18–20, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17457-5/pbk). Lecture Notes in Computer Science 6508, 369-384 (2010). MSC: 68U05 68W27 90C27 91A80 PDFBibTeX XMLCite \textit{E. Langetepe}, Lect. Notes Comput. Sci. 6508, 369--384 (2010; Zbl 1310.68206) Full Text: DOI
Correa, José R.; Epstein, Leah Bin packing with controllable item sizes. (English) Zbl 1169.90018 Inf. Comput. 206, No. 8, 1003-1016 (2008). MSC: 90C27 68W25 68W40 90C59 91B32 PDFBibTeX XMLCite \textit{J. R. Correa} and \textit{L. Epstein}, Inf. Comput. 206, No. 8, 1003--1016 (2008; Zbl 1169.90018) Full Text: DOI
Balcan, Maria-Florina; Blum, Avrim Approximation algorithms and online mechanisms for item pricing. (English) Zbl 1213.68699 Theory Comput. 3, Paper No. 9, 179-195 (2007). MSC: 68W25 68W20 68Q32 91B26 PDFBibTeX XMLCite \textit{M.-F. Balcan} and \textit{A. Blum}, Theory Comput. 3, Paper No. 9, 179--195 (2007; Zbl 1213.68699) Full Text: DOI
Hazan, Elad; Agarwal, Amit; Kale, Satyen Logarithmic regret algorithms for online convex optimization. (English) Zbl 1471.68327 Mach. Learn. 69, No. 2-3, 169-192 (2007). MSC: 68W27 68T05 90C25 91G10 PDFBibTeX XMLCite \textit{E. Hazan} et al., Mach. Learn. 69, No. 2--3, 169--192 (2007; Zbl 1471.68327) Full Text: DOI
Dulluri, Sandeep; Srinivasa Raghavan, N. R. Allocation of advertising space by a web service provider using combinatorial auctions. (English) Zbl 1096.90527 Sādhanā 30, No. 2-3, 213-230 (2005). MSC: 90B60 91A43 91B26 PDFBibTeX XMLCite \textit{S. Dulluri} and \textit{N. R. Srinivasa Raghavan}, Sādhanā 30, No. 2--3, 213--230 (2005; Zbl 1096.90527) Full Text: DOI
Yuen, Wing Ho; Sung, Chi Wan; Wong, Wing Shing Optimal price decremental strategy for Dutch auctions. (English) Zbl 1152.91476 Commun. Inf. Syst. 2, No. 4, 411-434 (2002). MSC: 91B26 PDFBibTeX XMLCite \textit{W. H. Yuen} et al., Commun. Inf. Syst. 2, No. 4, 411--434 (2002; Zbl 1152.91476) Full Text: DOI