English
Related papers

Related papers: Pricing to Maximize Revenue and Welfare Simultaneo…

200 papers

We study the classic setting of envy-free pricing, in which a single seller chooses prices for its many items, with the goal of maximizing revenue once the items are allocated. Despite the large body of work addressing such settings, most…

Computer Science and Game Theory · Computer Science 2017-05-03 Elliot Anshelevich , Koushik Kar , Shreyas Sekar

We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…

Computer Science and Game Theory · Computer Science 2015-11-10 Michal Feldman , Nick Gravin , Brendan Lucier

Selling a single item to $n$ self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical…

Computer Science and Game Theory · Computer Science 2024-11-06 Billy Jin , Thomas Kesselheim , Will Ma , Sahil Singla

We consider the problem of designing auctions which maximize consumer surplus (i.e., the social welfare minus the payments charged to the buyers). In the consumer surplus maximization problem, a seller with a set of goods faces a set of…

Computer Science and Game Theory · Computer Science 2025-03-18 Tomer Ezra , Daniel Schoepflin , Ariel Shaulker

Social goods are goods that grant value not only to their owners but also to the owners' surroundings, be it their families, friends or office mates. The benefit a non-owner derives from the good is affected by many factors, including the…

Computer Science and Game Theory · Computer Science 2017-07-04 Alon Eden , Tomer Ezra , Michal Feldman

We study the problem of a seller dynamically pricing $d$ distinct types of indivisible goods, when faced with the online arrival of unit-demand buyers drawn independently from an unknown distribution. The goods are not in limited supply,…

Data Structures and Algorithms · Computer Science 2017-06-13 Aaron Roth , Aleksandrs Slivkins , Jonathan Ullman , Zhiwei Steven Wu

We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…

Computer Science and Game Theory · Computer Science 2021-11-23 Gagan Aggarwal , Kshipra Bhawalkar , Guru Guruganesh , Andres Perlroth

We study equilibria of markets with $m$ heterogeneous indivisible goods and $n$ consumers with combinatorial preferences. It is well known that a competitive equilibrium is not guaranteed to exist when valuations are not gross substitutes.…

Computer Science and Game Theory · Computer Science 2014-06-04 Shahar Dobzinski , Michal Feldman , Inbal Talgam-Cohen , Omri Weinstein

We present a recommender system based on the Random Utility Model. Online shoppers are modeled as rational decision makers with limited information, and the recommendation task is formulated as the problem of optimally enriching the…

Computer Science and Game Theory · Computer Science 2024-09-24 Benjamin Heymann , Flavian Vasile , David Rohde

In various markets where sellers compete in price, price oscillations are observed rather than convergence to equilibrium. Such fluctuations have been empirically observed in the retail market for gasoline, in airline pricing and in the…

Computer Science and Game Theory · Computer Science 2015-04-28 Moshe Babaioff , Renato Paes Leme , Balasubramanian Sivan

Combinatorial Auctions are a central problem in Algorithmic Mechanism Design: pricing and allocating goods to buyers with complex preferences in order to maximize some desired objective (e.g., social welfare, revenue, or profit). The…

Computer Science and Game Theory · Computer Science 2015-03-19 Avrim Blum , Anupam Gupta , Yishay Mansour , Ankit Sharma

We consider a principal seller with $m$ heterogeneous products to sell to an additive buyer over independent items. The principal can offer an arbitrary menu of product bundles, but faces competition from smaller and more agile single-item…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Linda Cai , Brendan Lucier

We model the role of an online platform disrupting a market with unit-demand buyers and unit-supply sellers. Each seller can transact with a subset of the buyers whom she already knows, as well as with any additional buyers to whom she is…

Computer Science and Game Theory · Computer Science 2024-06-12 Luca D'Amico-Wong , Yannai A. Gonczarowski , Gary Qiurui Ma , David C. Parkes

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

We study the interplay of fairness, welfare, and equity considerations in personalized pricing based on customer features. Sellers are increasingly able to conduct price personalization based on predictive modeling of demand conditional on…

Machine Learning · Computer Science 2020-12-29 Nathan Kallus , Angela Zhou

We consider the pricing problem faced by a seller who assigns a price to a good that confers its benefits not only to its buyers, but also to other individuals around them. For example, a snow-blower is potentially useful not only to the…

Computer Science and Game Theory · Computer Science 2013-05-02 Michal Feldman , David Kempe , Brendan Lucier , Renato Paes Leme

Maximizing the revenue from selling _more than one_ good (or item) to a single buyer is a notoriously difficult problem, in stark contrast to the one-good case. For two goods, we show that simple "one-dimensional" mechanisms, such as…

Computer Science and Game Theory · Computer Science 2022-09-22 Sergiu Hart , Noam Nisan

Consider the seller's problem of finding optimal prices for her $n$ (divisible) goods when faced with a set of $m$ consumers, given that she can only observe their purchased bundles at posted prices, i.e., revealed preferences. We study…

Computer Science and Game Theory · Computer Science 2018-10-09 Ziwei Ji , Ruta Mehta , Matus Telgarsky

Dynamic pricing schemes were introduced as an alternative to posted-price mechanisms. In contrast to static models, the dynamic setting allows to update the prices between buyer-arrivals based on the remaining sets of items and buyers, and…

Computer Science and Game Theory · Computer Science 2022-04-27 Kristóf Bérczi , Erika R. Bérczi-Kovács , Evelin Szögi

Online markets are a part of everyday life, and their rules are governed by algorithms. Assuming participants are inherently self-interested, well designed rules can help to increase social welfare. Many algorithms for online markets are…

Computer Science and Game Theory · Computer Science 2022-02-01 Kanstantsin Pashkovich , Xinyue Xie
‹ Prev 1 2 3 10 Next ›