{"total":25,"rows":[{"id":"2109.06368","title":"Policy Optimization Using Semi-parametric Models for Dynamic Pricing","created":"2021-09-13","cited_by_count":23,"area":null},{"id":"2102.10221","title":"Logarithmic Regret in Feature-based Dynamic Pricing","created":"2021-02-20","cited_by_count":22,"area":null},{"id":"2201.11341","title":"Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise","created":"2022-01-27","cited_by_count":21,"area":null},{"id":"2106.14015","title":"Contextual Inverse Optimization: Offline and Online Learning","created":"2021-06-26","cited_by_count":20,"area":null},{"id":"2110.10018","title":"Dynamic pricing and assortment under a contextual MNL demand","created":"2021-10-19","cited_by_count":20,"area":null},{"id":"2109.03173","title":"Learning to Bid in Contextual First Price Auctions","created":"2021-09-07","cited_by_count":19,"area":null},{"id":"2106.04819","title":"Contextual Recommendations and Low-Regret Cutting-Plane Algorithms","created":"2021-06-09","cited_by_count":15,"area":null},{"id":"2501.14349","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2209.11837","title":"Doubly Fair Dynamic Pricing","created":"2022-09-23","cited_by_count":8,"area":null},{"id":"2602.01682","title":"Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets","created":"2026-02-02","cited_by_count":8,"area":null},{"id":"2106.04689","title":"Learning to Price Against a Moving Target","created":"2021-06-08","cited_by_count":5,"area":null},{"id":"2206.07528","title":"Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization","created":"2022-06-15","cited_by_count":4,"area":null},{"id":"2407.01566","title":"A Parametric Contextual Online Learning Theory of Brokerage","created":"2024-05-22","cited_by_count":4,"area":null},{"id":"2602.12903","title":"Contextual Online Bilateral Trade","created":"2026-02-13","cited_by_count":3,"area":null},{"id":"2609.13440","title":"Efficient Online Inverse Optimization with $O(d)$ Regret","created":"2026-09-11","cited_by_count":3,"area":null},{"id":"2605.05609","title":"Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand","created":"2026-05-07","cited_by_count":2,"area":null},{"id":"2609.26978","title":"Tight Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weights","created":"2026-09-22","cited_by_count":2,"area":null},{"id":"2307.13903","title":"Corruption-Robust Lipschitz Contextual Search","created":"2023-07-26","cited_by_count":1,"area":null},{"id":"2402.14013","title":"Misalignment, Learning, and Ranking: Harnessing Users Limited Attention","created":"2024-02-21","cited_by_count":1,"area":null},{"id":"2110.01072","title":"Active Learning for Contextual Search with Binary Feedbacks","created":"2021-10-03","cited_by_count":0,"area":null},{"id":"2111.08057","title":"Margin-Independent Online Multiclass Learning via Convex Geometry","created":"2021-11-15","cited_by_count":0,"area":null},{"id":"2303.15652","title":"Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model","created":"2023-03-28","cited_by_count":0,"area":null},{"id":"2512.09513","title":"Contextual Dynamic Pricing with Heterogeneous Buyers","created":"2025-12-10","cited_by_count":0,"area":null},{"id":"2602.21328","title":"Efficient Opportunistic Approachability","created":"2026-02-24","cited_by_count":0,"area":null},{"id":"2605.08290","title":"Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time","created":"2026-05-08","cited_by_count":0,"area":null}],"next_cursor":null}