paper-with-me

홈 › Papers

Optimal Non-parametric Learning in Repeated Contextual Auctions with Strategic Buyer

2020-01-01 · ICML 2020 1 · Alexey Drutsa

We study learning algorithms that optimize revenue in repeated contextual posted-price auctions where a seller interacts with a single strategic buyer that seeks to maximize his cumulative discounted surplus. The buyer's valuation of a good is a fixed private function of a $d$-dimensional context (feature) vector that describes the good being sold. In contrast to existing studies on repeated contextual auctions with strategic buyer, in our work, the seller is not assumed to know the parametric model that underlies this valuation function. We introduce a novel non-parametric learning algorithm that is horizon-independent and has tight strategic regret upper bound of $\Theta(T^{d/(d+1)})$. We also non-trivially generalize several value-localization techniques of non-contextual repeated auctions to make them effective in the considered contextual non-parametric learning of the buyer valuation function.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Bisection-Based Pricing for Repeated Contextual Auctions against Strategic Buyer

2020-01-01 · ICML 2020 1 · Anton Zhiyanov, Alexey Drutsa

We are interested in learning algorithms that optimize revenue in repeated contextual posted-price auctions where a single seller faces a single strategic buyer. In our setting, the buyer maximizes his expected cumulati…

Robust Pricing in Dynamic Mechanism Design

2020-01-01 · ICML 2020 1 · Yuan Deng, Sébastien Lahaie, Vahab Mirrokni

Motivated by the repeated sale of online ads via auctions, optimal pricing in repeated auctions has attracted a large body of research. While dynamic mechanisms offer powerful techniques to improve on both revenue and ef…

Repeated Contextual Auctions with Strategic Buyers

2014-12-01 · NeurIPS 2014 12 · Kareem Amin, Afshin Rostamizadeh, Umar Syed

Motivated by real-time advertising exchanges, we analyze the problem of pricing inventory in a repeated posted-price auction. We consider both the cases of a truthful and surplus-maximizing buyer, where the former makes …

Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer

2018-07-01 · ICML 2018 7 · Alexey Drutsa

We study revenue optimization learning algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation for a good and seeks to maximize his c…

Incentive-aware Contextual Pricing with Non-parametric Market Noise

2019-11-08 · Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang

We consider a dynamic pricing problem for repeated contextual second-price auctions with multiple strategic buyers who aim to maximize their long-term time discounted utility. The seller has limited information on buyers…