Search Results for author:
Found 3 papers, 0 papers with code
Multi-Platform Budget Management in Ad Markets with Non-IC Auctions
Our strategy maximizes the expected total utility across auctions while satisfying the advertiser's budget constraints in expectation.
Active Learning for Non-Parametric Choice Models
To overcome the identifiability problem, we introduce a directed acyclic graph (DAG) representation of the choice model.
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
We leverage this notion to transform greedy robust offline algorithms into a $O(T^{2/3})$ (approximate) regret in the bandit setting.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
