19 citations · 74 across the 51 of their papers we have counts for
59 papers
Optimal and Efficient Online Inverse Optimization
Anupam Gupta, Guru Guruganesh, Honghao Lin +3
In online inverse linear optimization, a learner recommends an action and then observes the choice of an expert who maximizes a fixed, unknown linear objective on ;…
Efficient Online Inverse Optimization with Regret
Yang Cai, Anupam Gupta, Vineet Gupta +7
We give a deterministic algorithm for online inverse linear optimization with regret , uniform in the horizon and time per round. A bound of this order was obtaine…
Graphic Matroid Secretary without the Graph
Paul Dütting, Renato Paes Leme, Martin Pál +1
The matroid secretary problem (MSP) is one of the cleanest, and most captivating open problems in online algorithms. The famous MSP conjecture stipulates that there exists a consta…
Resource Allocation and Conversion along the Org Chart
Yuan Deng, Giannis Fikioris, Chido Onyeze +3
We consider the allocation of multiple heterogeneous resources to agents who are organized according to an organizational hierarchy. In a company those correspond to business units…
Compensation Design
Ioannis Anagnostides, Kshipra Bhawalkar, Christopher Liaw +5
We introduce compensation design, the problem of designing payment rules that incentivize high-quality contributions in decentralized environments. Here, a budget-constrained princ…
Quota Marketplace: Dynamic Pricing for Efficient Allocation of ML Training Resources
Balasubramanian Sivan, Renato Paes Leme, Mihai Tiuca +6
The escalating demand for Machine Learning (ML) training resources in recent years has resulted in a substantial gap between the high demand and the available supply. Efficient all…