{"total":17,"rows":[{"id":"2106.14015","title":"Contextual Inverse Optimization: Offline and Online Learning","created":"2021-06-26","cited_by_count":20,"area":null},{"id":"2301.11260","title":"Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programming","created":"2023-01-26","cited_by_count":13,"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":"2501.13648","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","created":"2025-01-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":"2304.07407","title":"Repeated Principal-Agent Games with Unobserved Agent Rewards and Perfect-Knowledge Agents","created":"2023-04-14","cited_by_count":7,"area":null},{"id":"2603.20826","title":"Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness","created":"2026-03-21","cited_by_count":6,"area":null},{"id":"2308.06717","title":"Estimating and Incentivizing Imperfect-Knowledge Agents with Hidden Rewards","created":"2023-08-13","cited_by_count":5,"area":null},{"id":"2405.14273","title":"Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods","created":"2024-05-23","cited_by_count":4,"area":null},{"id":"2102.12415","title":"Using Inverse Optimization to Learn Cost Functions in Generalized Nash Games","created":"2021-02-24","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":"2510.04455","title":"Inverse Mixed-Integer Programming: Learning Constraints then Objective Functions","created":"2025-10-06","cited_by_count":2,"area":null},{"id":"2607.22263","title":"Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs","created":"2026-07-24","cited_by_count":2,"area":null},{"id":"2609.09809","title":"Online Inverse Integer Linear Optimization via Small-Gradient Skipping: Constant Regret and Finite Mistakes","created":"2026-09-09","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":"2610.08735","title":"Optimal and Efficient Online Inverse Optimization","created":"2026-10-06","cited_by_count":0,"area":null},{"id":"2610.09890","title":"Outperformance Inverse Optimization: Learning Objective Functions that Outperform Agent Decisions","created":"2026-10-07","cited_by_count":0,"area":null}],"next_cursor":null}