English
Related papers

Related papers: Bandit Profit-maximization for Targeted Marketing

200 papers

Originally motivated by default risk management applications, this paper investigates a novel problem, referred to as the profitable bandit problem here. At each step, an agent chooses a subset of the K possible actions. For each action…

Machine Learning · Statistics 2018-05-09 Mastane Achab , Stephan Clémençon , Aurélien Garivier

We propose a contextual-bandit approach for demand side management by offering price incentives. More precisely, a target mean consumption is set at each round and the mean consumption is modeled as a complex function of the distribution of…

Machine Learning · Computer Science 2019-05-14 Margaux Brégère , Pierre Gaillard , Yannig Goude , Gilles Stoltz

This paper introduces a novel contextual bandit algorithm for personalized pricing under utility fairness constraints in scenarios with uncertain demand, achieving an optimal regret upper bound. Our approach, which incorporates dynamic…

Machine Learning · Statistics 2023-11-29 Xi Chen , David Simchi-Levi , Yining Wang

We study a novel multi-armed bandit problem that models the challenge faced by a company wishing to explore new strategies to maximize revenue whilst simultaneously maintaining their revenue above a fixed baseline, uniformly over time.…

Machine Learning · Statistics 2016-02-16 Yifan Wu , Roshan Shariff , Tor Lattimore , Csaba Szepesvári

Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a broker, in a regret…

Computer Science and Game Theory · Computer Science 2025-09-29 Simone Di Gregorio , Paul Dütting , Federico Fusco , Chris Schwiegelshohn

We study contextual dynamic pricing problems where a firm sells products to $T$ sequentially-arriving consumers, behaving according to an unknown demand model. The firm aims to minimize its regret over a clairvoyant that knows the model in…

Machine Learning · Computer Science 2025-04-07 Zifeng Zhao , Feiyu Jiang , Yi Yu

We consider a robust version of the revenue maximization problem, where a single seller wishes to sell $n$ items to a single unit-demand buyer. In this robust version, the seller knows the buyer's marginal value distribution for each item…

Computer Science and Game Theory · Computer Science 2020-08-27 Moshe Babaioff , Michal Feldman , Yannai A. Gonczarowski , Brendan Lucier , Inbal Talgam-Cohen

Targeted marketing policies target different customers with different marketing actions. While most research has focused on training targeting policies without managerial constraints, in practice, many firms face managerial constraints when…

Optimization and Control · Mathematics 2023-12-20 Haihao Lu , Duncan Simester , Yuting Zhu

Price discrimination for maximizing expected profit is a well-studied concept in economics and there are various methods that achieve the maximum given the user type distribution and the budget constraints. In many applications,…

General Economics · Economics 2021-03-03 Ghurumuruhan Ganesan

This paper studies a sequential decision problem where payoff distributions are known and where the riskiness of payoffs matters. Equivalently, it studies sequential choice from a repeated set of independent lotteries. The decision-maker is…

Theoretical Economics · Economics 2024-01-02 Zengjing Chen , Larry G. Epstein , Guodong Zhang

Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, who wish to trade a good. We study this problem from the perspective of a profit-maximizing broker within an online learning framework,…

Computer Science and Game Theory · Computer Science 2026-05-14 Simone Di Gregorio , Paul Dütting , Federico Fusco , Chris Schwiegelshohn

We consider dynamic pricing with many products under an evolving but low-dimensional demand model. Assuming the temporal variation in cross-elasticities exhibits low-rank structure based on fixed (latent) features of the products, we show…

Machine Learning · Computer Science 2019-09-12 Jonas Mueller , Vasilis Syrgkanis , Matt Taddy

Contextual bandit algorithms are at the core of many applications, including recommender systems, clinical trials, and optimal portfolio selection. One of the most popular problems studied in the contextual bandit literature is to maximize…

Machine Learning · Computer Science 2023-10-24 Siddhant Chaudhary , Abhishek Sinha

We consider a periodical equilibrium pricing problem for multiple firms over a planning horizon of T periods. At each period, firms set their selling prices and receive stochastic demand from consumers. Firms do not know their underlying…

Computer Science and Game Theory · Computer Science 2024-06-07 Yongge Yang , Yu-Ching Lee , Po-An Chen

Optimizing the assortment of products to display to customers is a key to increasing revenue for both offline and online retailers. To trade-off between exploring customers' preference and exploiting customers' choices learned from data, in…

Machine Learning · Computer Science 2022-04-25 Hongbin Zhang , Yu Yang , Feng Wu , Qixin Zhang

We study the problem of an online advertising system that wants to optimally spend an advertiser's given budget for a campaign across multiple platforms, without knowing the value for showing an ad to the users on those platforms. We model…

Computer Science and Game Theory · Computer Science 2021-03-26 Vashist Avadhanula , Riccardo Colini-Baldeschi , Stefano Leonardi , Karthik Abinav Sankararaman , Okke Schrijvers

We consider markets consisting of a set of indivisible items, and buyers that have {\em sharp} multi-unit demand. This means that each buyer $i$ wants a specific number $d_i$ of items; a bundle of size less than $d_i$ has no value, while a…

Computer Science and Game Theory · Computer Science 2015-03-13 Ning Chen , Xiaotie Deng , Paul. W. Goldberg , Jinshan Zhang

Key challenges in running a retail business include how to select products to present to consumers (the assortment problem), and how to price products (the pricing problem) to maximize revenue or profit. Instead of considering these…

Machine Learning · Statistics 2023-09-19 Junhui Cai , Ran Chen , Martin J. Wainwright , Linda Zhao

In this work, we investigate the problem of adapting to the presence or absence of causal structure in multi-armed bandit problems. In addition to the usual reward signal, we assume the learner has access to additional variables, observed…

Machine Learning · Computer Science 2024-07-02 Ziyi Liu , Idan Attias , Daniel M. Roy

In continuous-choice settings, consumers decide not only on whether to purchase a product, but also on how much to purchase. Thus, firms optimize a full price schedule rather than a single price point. This paper provides a methodology to…

General Economics · Economics 2024-08-13 Soheil Ghili , Russ Yoon
‹ Prev 1 2 3 10 Next ›