Search Results for author:
Found 2 papers, 0 papers with code
Fair Dynamic Rationing
For an arbitrarily correlated sequence of demands, we establish upper bounds on the expected minimum fill rate (ex-post fairness) and the minimum expected fill rate (ex-ante fairness) achievable by any policy.
Fairness
Computer Science and Game Theory
Data Structures and Algorithms
Learning Product Rankings Robust to Fake Users
We first show that existing learning algorithms---that are optimal in the absence of fake users---may converge to highly sub-optimal rankings under manipulation by fake users.
