English
Related papers

Related papers: Simple and Approximately Optimal Pricing for Propo…

200 papers

Although approximate notions of envy-freeness-such as envy-freeness up to one good (EF1)-have been extensively studied for indivisible goods, the seemingly simpler fairness concept of proportionality up to one good (PROP1) has received far…

Computer Science and Game Theory · Computer Science 2025-08-19 Martin Jupakkal Andersen , Ioannis Caragiannis , Anders Bo Ipsen , Alexander Søltoft

We consider a multiproduct monopoly pricing model. We provide sufficient conditions under which the optimal mechanism can be implemented via upgrade pricing -- a menu of product bundles that are nested in the strong set order. Our approach…

Computer Science and Game Theory · Computer Science 2021-12-03 Dirk Bergemann , Alessandro Bonatti , Andreas Haupt , Alex Smolin

We derive valuations of a portfolio of financial instruments from a securities lending perspective, under different assumptions, and show a weighting scheme that converges to the true valuation. We illustrate conditions under which our…

Pricing of Securities · Quantitative Finance 2019-07-23 Ravi Kashyap

We study the problem of multi-dimensional revenue maximization when selling $m$ items to a buyer that has additive valuations for them, drawn from a (possibly correlated) prior distribution. Unlike traditional Bayesian auction design, we…

Computer Science and Game Theory · Computer Science 2022-04-29 Yiannis Giannakopoulos , Diogo Poças , Alexandros Tsigonias-Dimitriadis

Complementary item recommendations are a ubiquitous feature of modern e-commerce sites. Such recommendations are highly effective when they are based on collaborative signals like co-purchase statistics. In certain online marketplaces,…

Information Retrieval · Computer Science 2023-03-13 Koby Bibas , Oren Sar Shalom , Dietmar Jannach

Consider the following toy problem. There are $m$ rectangles and $n$ points on the plane. Each rectangle $R$ is a consumer with budget $B_R$, who is interested in purchasing the cheapest item (point) inside R, given that she has enough…

Computer Science and Game Theory · Computer Science 2012-07-25 Parinya Chalermsook , Khaled Elbassioni , Danupon Nanongkai , He Sun

We show that the Revenue-Optimal Deterministic Mechanism Design problem for a single additive buyer is #P-hard, even when the distributions have support size 2 for each item and, more importantly, even when the optimal solution is…

Computer Science and Game Theory · Computer Science 2017-07-17 Xi Chen , George Matikas , Dimitris Paparas , Mihalis Yannakakis

We study the problem of fairly allocating indivisible goods and focus on the classic fairness notion of proportionality. The indivisibility of the goods is long known to pose highly non-trivial obstacles to achieving fairness, and a very…

Computer Science and Game Theory · Computer Science 2021-01-15 Artem Baklanov , Pranav Garimidi , Vasilis Gkatzelis , Daniel Schoepflin

Optimal mechanism design enjoys a beautiful and well-developed theory, and also a number of killer applications. Rules of thumb produced by the field influence everything from how governments sell wireless spectrum licenses to how the major…

Computer Science and Game Theory · Computer Science 2014-09-23 Tim Roughgarden

We investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

Computer Science and Game Theory · Computer Science 2020-10-16 Will Ma

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

The growing demand for data and AI-generated digital goods, such as personalized written content and artwork, necessitates effective pricing and feedback mechanisms that account for uncertain utility and costly production. Motivated by…

Computer Science and Game Theory · Computer Science 2023-06-06 Zachary Robertson , Oluwasanmi Koyejo

Embedding based product recommendations have gained popularity in recent years due to its ability to easily integrate to large-scale systems and allowing nearest neighbor searches in real-time. The bulk of studies in this area has…

Information Retrieval · Computer Science 2022-11-30 Giorgi Kvernadze , Putu Ayu G. Sudyanti , Nishan Subedi , Mohammad Hajiaghayi

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

We study \emph{combinatorial procurement auctions}, where a buyer with a valuation function $v$ and budget $B$ wishes to buy a set of items. Each item $i$ has a cost $c_i$ and the buyer is interested in a set $S$ that maximizes $v(S)$…

Computer Science and Game Theory · Computer Science 2015-03-19 Ashwinkumar Badanidiyuru , Shahar Dobzinski , Sigal Oren

Finding the optimal (revenue-maximizing) mechanism to sell multiple items has been a prominent and notoriously difficult open problem. Existing work has mainly focused on deriving analytical results tailored to a particular class of…

Theoretical Economics · Economics 2026-01-09 Kento Hashimoto , Keita Kuwahara , Reo Nonaka

We study revenue maximization in multi-item multi-bidder auctions under the natural item-independence assumption - a classical problem in Multi-Dimensional Bayesian Mechanism Design. One of the biggest challenges in this area is developing…

Computer Science and Game Theory · Computer Science 2022-04-12 Yang Cai , Argyris Oikonomou , Mingfei Zhao

In contextual dynamic pricing, a seller sequentially prices goods based on contextual information. Buyers will purchase products only if the prices are below their valuations. The goal of the seller is to design a pricing strategy that…

Machine Learning · Statistics 2025-02-14 Matilde Tullii , Solenne Gaucher , Nadav Merlis , Vianney Perchet

We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting rationally and strategically in order to maximize utility. Our…

Computer Science and Game Theory · Computer Science 2021-06-01 Alexander Braun , Thomas Kesselheim