Approximate Submodularity in Network Design Problems
Levi DeValve, Saša Pekeč, Yehua Wei
págs. 1021-1039
Dynamic Programming Principles for Mean-Field Controls with Learning
Haotian Gu, Xin Guo, Xiaoli Wei, Renyuan Xu
págs. 1040-1054
Production Planning with Risk Hedging Under a Conditional Value at Risk Objective
Liao Wang, David D. Yao
págs. 1055-1072
Store-Wide Shelf-Space Allocation with Ripple Effects Driving Traffic
Tülay Flamand, Ahmed Ghoniem, Bacel Maddah
págs. 1073-1092
págs. 1093-1111
Sumit Kunnumkal
págs. 1112-1119
Contextual Search in the Presence of Adversarial Corruptions
Akshay Krishnamurthy, Thodoris Lykouris, Chara Podimata, Robert Schapire
págs. 1120-1135
Product Ranking in the Presence of Social Learning
Costis Maglaras, Marco Scarsini, Dongwook Shin, Stefano Vaccari
págs. 1136-1153
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products
Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shamel
págs. 1154-1170
Learning Product Rankings Robust to Fake Users
Negin Golrezaei, Vahideh Manshadi, Jon Schneider, Shreyas Sekar
págs. 1171-1196
Omar El Housni, Huseyin Topaloglu
págs. 1197-1215
Ali Aouad, Danny Segev
págs. 1216-1249
Technical Note—Bidding in Multidimensional Auctions When the Qualities of All Bidders Matter
Panos L. Lorentziadis
págs. 1250-1259
págs. 1270-1276
Economic Behavior of Information Acquisition: Impact on Peer Grading in Massive Open Online Courses
Onesun Steve Yoo, Dongyuan Zhan
págs. 1277-1297
Voxel-Based Solution Approaches to the Three-Dimensional Irregular Packing Problem
Carlos Lamas-Fernandez, Julia A. Bennell, Antonio Martínez Sykora
págs. 1298-1317
Accelerated MM Algorithms for Inference of Ranking Scores from Comparison Data
Milan Vojnović, Se-Young Yun, Kaifang Zhou
págs. 1318-1342
Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization
Dimitris Bertsimas, Nishanth Mundru
págs. 1343-1361
Robust Dynamic Pricing with Demand Learning in the Presence of Outlier Customers
Xi Chen, Yining Wang
págs. 1362-1386
Managing Queues with Different Resource Requirements
Noa Zychlinski, Carri W Chan, Jing Dong
págs. 1387-1413
Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem
Ali Aouad, Danny Segev
págs. 1414-1433
Nima Hamidi, Mohsen Bayati
págs. 1434-1439
© 2008-2024 Fundación Dialnet · Todos los derechos reservados