English
Related papers

Related papers: Online Learning for Equilibrium Pricing in Markets…

200 papers

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

Making an informed decision -- for example, when choosing a career or housing -- requires knowledge about the available options. Such knowledge is generally acquired through costly trial and error, but this learning process can be disrupted…

Machine Learning · Computer Science 2022-04-15 Sarah H. Cen , Devavrat Shah

We study the bidding problem in repeated uniform price multi-unit auctions from the perspective of a value-maximizing buyer. The buyer aims to maximize their cumulative value over $T$ rounds while adhering to per-round return-on-investment…

Data Structures and Algorithms · Computer Science 2025-10-07 Negin Golrezaei , Sourav Sahoo

In this paper, we propose a learning approach to analyze dynamic systems with asymmetric information structure. Instead of adopting a game theoretic setting, we investigate an online quadratic optimization problem driven by system noises…

Optimization and Control · Mathematics 2018-11-05 Cheng Tan , Wing Shing Wong

In this paper we study the mincut problem in the online setting. We consider two distinct models: A) competitive analysis and B) regret analysis. In the competitive setting we consider the vertex arrival model; whenever a new vertex arrives…

Data Structures and Algorithms · Computer Science 2020-08-17 Avah Banerjee , Guoli Ding

We study optimal monopoly pricing over consumer networks governed by general nonlinear utilities. In our framework, a consumer's utility is jointly determined by an individualized price and the consumption choices of their peers, propagated…

Statistics Theory · Mathematics 2026-05-15 Daniele Bracale , George Michailidis

As data marketplaces become increasingly central to the digital economy, it is crucial to design efficient pricing mechanisms that optimize revenue while ensuring fair and adaptive pricing. We introduce the Maximum Auction-to-Posted Price…

Machine Learning · Statistics 2026-04-06 Yingqi Gao , Wenlu Xu , Jin J. Zhou , Hua Zhou , Yong Chen , Xiaowu Dai

We study the problem of sorting under incomplete information, when queries are used to resolve uncertainties. Each of $n$ data items has an unknown value, which is known to lie in a given interval. We can pay a query cost to learn the…

Data Structures and Algorithms · Computer Science 2021-04-16 Magnús M. Halldórsson , Murilo S. de Lima

Machine learning algorithms are increasingly employed to price or value homes for sale, properties for rent, rides for hire, and various other goods and services. Machine learning-based prices are typically generated by complex algorithms…

Theoretical Economics · Economics 2023-02-21 Nikhil Malik , Emaad Manzoor

We consider the online version of the isotonic regression problem. Given a set of linearly ordered points (e.g., on the real line), the learner must predict labels sequentially at adversarially chosen positions and is evaluated by her total…

Machine Learning · Computer Science 2016-10-10 Wojciech Kotłowski , Wouter M. Koolen , Alan Malek

We study online bilateral trade, where a learner facilitates repeated exchanges between a buyer and a seller to maximize the Gain From Trade (GFT), i.e., the social welfare. In doing so, the learner must guarantee not to subsidize the…

Computer Science and Game Theory · Computer Science 2026-02-06 Anna Lunghi , Mattia Piccinato , Matteo Castiglioni , Alberto Marchesi

In this paper we investigate the problem of measuring end-to-end Incentive Compatibility (IC) regret given black-box access to an auction mechanism. Our goal is to 1) compute an estimate for IC regret in an auction, 2) provide a measure of…

Computer Science and Game Theory · Computer Science 2019-06-05 Zhe Feng , Okke Schrijvers , Eric Sodomka

We study offline dynamic pricing when historical data provide incomplete coverage of the price space such that some candidate prices, including the optimal one, may be entirely unobserved. This setting is common in practice and is…

Machine Learning · Statistics 2026-05-25 Zeyu Bian , Lan Wang , Zhengling Qi

We study a Markov matching market involving a planner and a set of strategic agents on the two sides of the market. At each step, the agents are presented with a dynamical context, where the contexts determine the utilities. The planner…

Machine Learning · Computer Science 2022-03-09 Yifei Min , Tianhao Wang , Ruitu Xu , Zhaoran Wang , Michael I. Jordan , Zhuoran Yang

We study the attainable regret for online linear optimization problems with bandit feedback, where unlike the full-information setting, the player can only observe its own loss rather than the full loss vector. We show that the price of…

Machine Learning · Computer Science 2014-08-12 Ohad Shamir

We define an online learning and optimization problem with discrete and irreversible decisions contributing toward a coverage target. In each period, a decision-maker selects facilities to open, receives information on the success of each…

Machine Learning · Computer Science 2026-03-06 Alexandre Jacquillat , Michael Lingzhi Li

We consider a setting where $n$ buyers, with combinatorial preferences over $m$ items, and a seller, running a priority-based allocation mechanism, repeatedly interact. Our goal, from observing limited information about the results of these…

Computer Science and Game Theory · Computer Science 2014-08-29 Avrim Blum , Yishay Mansour , Jamie Morgenstern

We are interested in the effect of consumer demand estimation error for new products in the context of production planning. An inventory model is proposed, whereby demand is influenced by price and advertising. The effect of parameter…

Optimization and Control · Mathematics 2015-10-23 Antoine Deza , Kai Huang , Michael R. Metel

Recently the online advertising market has exhibited a gradual shift from second-price auctions to first-price auctions. Although there has been a line of works concerning online bidding strategies in first-price auctions, it still remains…

Computer Science and Game Theory · Computer Science 2022-05-31 Rui Ai , Chang Wang , Chenchen Li , Jinshan Zhang , Wenhan Huang , Xiaotie Deng

We examine two types of binary betting markets, whose primary goal is for profit (such as sports gambling) or to gain information (such as prediction markets). We articulate the interplay between belief and price-setting to analyse both…

Computer Science and Game Theory · Computer Science 2024-06-07 Haiqing Zhu , Alexander Soen , Yun Kuen Cheung , Lexing Xie