2 citations · 3 across the 8 of their papers we have counts for
3 papers · 1 filter
Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning
Joon Suk Huh, Kirthevasan Kandasamy
We study a multi-round mechanism design problem, where we interact with a set of agents over a sequence of rounds. We wish to design an incentive-compatible (IC) online learning sc…
Learning to Price Homogeneous Data
Keran Chen, Joon Suk Huh, Kirthevasan Kandasamy
We study a data pricing problem, where a seller has access to homogeneous data points (e.g. drawn i.i.d. from some distribution). There are types of buyers in the market, w…
Bandit Profit-maximization for Targeted Marketing
Joon Suk Huh, Ellen Vitercik, Kirthevasan Kandasamy
We study a sequential profit-maximization problem, optimizing for both price and ancillary variables like marketing expenditures. Specifically, we aim to maximize profit over an ar…