Multidimensional Binary Search for Contextual Decision-Making

DOI10.1287/opre.2018.1722zbMath1443.90221arXiv1611.00829OpenAlexW2884962924WikidataQ129472218 ScholiaQ129472218MaRDI QIDQ4971566

Ilan Lobel, Renato Paes Leme, Adrian Vladu

Publication date: 12 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.00829

zbMATH Keywords

online algorithmscontextual pricingonline decision making

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Contextual Search via Intrinsic Volumes ⋮ Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions ⋮ Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models

Cites Work

• Unnamed Item
• Unnamed Item
• Partitions of mass-distributions and of convex bodies by hyperplanes
• On parallel complexity of nonsmooth convex optimization
• Hit-and-run mixes fast
• Faster mixing via average conductance
• Online Learning and Online Convex Optimization
• Solving convex programs by random walks
• A simple polynomial-time rescaling algorithm for solving linear programs

This page was built for publication: Multidimensional Binary Search for Contextual Decision-Making