Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions
- URL: http://arxiv.org/abs/2002.11137v1
- Date: Tue, 25 Feb 2020 19:00:29 GMT
- Title: Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions
- Authors: Negin Golrezaei, Adel Javanmard and Vahab Mirrokni
- Abstract summary: We consider the problem of robust learning of reserve prices against strategic buyers in contextual second-price auctions.
We propose learning policies that are robust to such strategic behavior.
- Score: 13.234975857626752
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Motivated by pricing in ad exchange markets, we consider the problem of
robust learning of reserve prices against strategic buyers in repeated
contextual second-price auctions. Buyers' valuations for an item depend on the
context that describes the item. However, the seller is not aware of the
relationship between the context and buyers' valuations, i.e., buyers'
preferences. The seller's goal is to design a learning policy to set reserve
prices via observing the past sales data, and her objective is to minimize her
regret for revenue, where the regret is computed against a clairvoyant policy
that knows buyers' heterogeneous preferences. Given the seller's goal,
utility-maximizing buyers have the incentive to bid untruthfully in order to
manipulate the seller's learning policy. We propose learning policies that are
robust to such strategic behavior. These policies use the outcomes of the
auctions, rather than the submitted bids, to estimate the preferences while
controlling the long-term effect of the outcome of each auction on the future
reserve prices. When the market noise distribution is known to the seller, we
propose a policy called Contextual Robust Pricing (CORP) that achieves a
T-period regret of $O(d\log(Td) \log (T))$, where $d$ is the dimension of {the}
contextual information. When the market noise distribution is unknown to the
seller, we propose two policies whose regrets are sublinear in $T$.
Related papers
- A pragmatic policy learning approach to account for users' fatigue in repeated auctions [47.75983850930121]
ML models can predict how previously won auctions the current opportunity value.
A policy that uses this prediction tomaximize the expected payoff of the current auction could be dubbedimpatient.
We provide two empirical arguments for the importance of this cost ofimpatience.
arXiv Detail & Related papers (2024-07-15T07:53:29Z) - A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
We address the problem of dynamically pricing complementary items that are sequentially displayed to customers.
Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective.
We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
arXiv Detail & Related papers (2024-07-08T09:55:31Z) - Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback [58.66941279460248]
Learning from human feedback plays an important role in aligning generative models, such as large language models (LLM)
We study a model within this problem domain--contextual dueling bandits with adversarial feedback, where the true preference label can be flipped by an adversary.
We propose an algorithm namely robust contextual dueling bandit (algo), which is based on uncertainty-weighted maximum likelihood estimation.
arXiv Detail & Related papers (2024-04-16T17:59:55Z) - Dynamic Pricing and Learning with Long-term Reference Effects [16.07344044662994]
We study a simple and novel reference price mechanism where reference price is the average of the past prices offered by the seller.
We show that under this mechanism, a markdown policy is near-optimal irrespective of the parameters of the model.
We then consider a more challenging dynamic pricing and learning problem, where the demand model parameters are apriori unknown.
arXiv Detail & Related papers (2024-02-19T21:36:54Z) - Contextual Dynamic Pricing with Strategic Buyers [93.97401997137564]
We study the contextual dynamic pricing problem with strategic buyers.
Seller does not observe the buyer's true feature, but a manipulated feature according to buyers' strategic behavior.
We propose a strategic dynamic pricing policy that incorporates the buyers' strategic behavior into the online learning to maximize the seller's cumulative revenue.
arXiv Detail & Related papers (2023-07-08T23:06:42Z) - Dynamic Pricing and Learning with Bayesian Persuasion [18.59029578133633]
We consider a novel dynamic pricing and learning setting where in addition to setting prices of products, the seller also ex-ante commits to 'advertising schemes'
We use the popular Bayesian persuasion framework to model the effect of these signals on the buyers' valuation and purchase responses.
We design an online algorithm that can use past purchase responses to adaptively learn the optimal pricing and advertising strategy.
arXiv Detail & Related papers (2023-04-27T17:52:06Z) - A Reinforcement Learning Approach in Multi-Phase Second-Price Auction
Design [158.0041488194202]
We study reserve price optimization in multi-phase second price auctions.
From the seller's perspective, we need to efficiently explore the environment in the presence of potentially nontruthful bidders.
Third, the seller's per-step revenue is unknown, nonlinear, and cannot even be directly observed from the environment.
arXiv Detail & Related papers (2022-10-19T03:49:05Z) - Price DOES Matter! Modeling Price and Interest Preferences in
Session-based Recommendation [55.0391061198924]
Session-based recommendation aims to predict items that an anonymous user would like to purchase based on her short behavior sequence.
It is nontrivial to incorporate price preferences for session-based recommendation.
We propose a novel method Co-guided Heterogeneous Hypergraph Network (CoHHN) for session-based recommendation.
arXiv Detail & Related papers (2022-05-09T10:47:15Z) - Distribution-free Contextual Dynamic Pricing [5.773269033551628]
Contextual dynamic pricing aims to set personalized prices based on sequential interactions with customers.
In this paper, we consider contextual dynamic pricing with unknown random noise in the valuation model.
Our distribution-free pricing policy learns both the contextual function and the market noise simultaneously.
arXiv Detail & Related papers (2021-09-15T14:52:44Z) - Learning to Price Against a Moving Target [23.085429420254787]
We study the problem where the buyer's value is a moving target, i.e., they change over time.
In either case, we provide upper and lower bounds on the optimal revenue loss.
arXiv Detail & Related papers (2021-06-08T20:57:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.