English
Related papers

Related papers: Targeting Without Transfers

200 papers

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

We study envy-free allocations of indivisible goods to agents in settings where each agent is unaware of the goods allocated to other agents. In particular, we propose the maximin aware (MMA) fairness measure, which guarantees that every…

Computer Science and Game Theory · Computer Science 2019-10-29 Hau Chan , Jing Chen , Bo Li , Xiaowei Wu

We study the problem of designing revenue-maximizing mechanisms for a selfish mediator who facilitates trade between a buyer and a seller. We consider a setting where the mediator does not have information advantage and the buyer's…

Computer Science and Game Theory · Computer Science 2026-03-10 Zhikang Fan , Weiran Shen , Shaojie Tang , Yao Wang

We consider revenue-optimal mechanism design in the interdimensional setting, where one dimension is the 'value' of the buyer, and one is a 'type' that captures some auxiliary information. One setting is the FedEx Problem, for which FGKK…

Computer Science and Game Theory · Computer Science 2020-02-18 Nikhil Devanur , Kira Goldner , Raghuvansh Saxena , Ariel Schvartzman , S. Matthew Weinberg

Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyer's valuations for the items come i.i.d. from a uniform…

Computer Science and Game Theory · Computer Science 2015-10-14 Yiannis Giannakopoulos

Consider a barter exchange problem over a finite set of agents, where each agent owns an item and is also associated with a (privately known) wish list of items belonging to the other agents. An outcome of the problem is a (re)allocation of…

Computer Science and Game Theory · Computer Science 2024-10-10 Yuval Emek , Matan-El Shpiro

We study the problem of mechanism design for allocating a set of indivisible items among agents with private preferences on items. We are interested in such a mechanism that is strategyproof (where agents' best strategy is to report their…

Computer Science and Game Theory · Computer Science 2024-08-05 Ankang Sun , Bo Chen

We consider the design of mechanisms that allocate limited resources among self-interested agents using neural networks. Unlike the recent works that leverage machine learning for revenue maximization in auctions, we consider welfare…

Computer Science and Game Theory · Computer Science 2024-08-15 Sihan Zeng , Sujay Bhatt , Eleonora Kreacic , Parisa Hassanzadeh , Alec Koppel , Sumitra Ganesh

This paper develops a model of in-kind redistribution where consumers participate in either a private market or a government-designed program, but not both. We characterize when a social planner, seeking to maximize weighted total surplus,…

General Economics · Economics 2024-10-25 Zi Yang Kang , Mitchell Watt

We study how to optimally design selection mechanisms, accounting for agents' investment incentives. A principal wishes to allocate a resource of homogeneous quality to a heterogeneous population of agents. The principal commits to a…

Theoretical Economics · Economics 2025-11-11 Victor Augias , Eduardo Perez-Richet

When a company undergoes a merger or transfers its ownership, the existing governing body has an opinion on which buyer should take over as the new owner. Similar situations occur while assigning the host of big sports tournaments, like the…

Computer Science and Game Theory · Computer Science 2020-02-24 Ioannis Caragiannis , Aris Filos-Ratsikas , Swaprava Nath , Alexandros A. Voudouris

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

This paper studies optimal bundling of products with non-additive values. Under monotonic preferences and single-peaked profits, I show a monopolist finds pure bundling optimal if and only if the optimal sales volume for the grand bundle is…

General Economics · Economics 2022-04-22 Soheil Ghili

We study balanced exchange problems in which agents with responsive preferences are endowed with multiple indivisible objects and can trade without transfers (e.g. shift exchange, time-banking). Eliciting full preferences over bundles is…

Theoretical Economics · Economics 2026-04-14 Vikram Manjunath , Alexander Westkamp

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 consider a monopolist seller with $n$ heterogeneous items, facing a single buyer. The buyer has a value for each item drawn independently according to (non-identical) distributions, and her value for a set of items is additive. The…

Computer Science and Game Theory · Computer Science 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg

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

The role of a market maker is to simultaneously offer to buy and sell quantities of goods, often a financial asset such as a share, at specified prices. An automated market maker (AMM) is a mechanism that offers to trade according to some…

Computer Science and Game Theory · Computer Science 2024-02-15 Michael J. Curry , Zhou Fan , David C. Parkes

We consider the design of a revenue-optimal mechanism when two items are available to be sold to a single buyer whose valuation is uniformly distributed over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive…

Computer Science and Game Theory · Computer Science 2019-03-06 D. Thirumulanathan , Rajesh Sundaresan , Y Narahari

We study fair allocation of constrained resources, where a market designer optimizes overall welfare while maintaining group fairness. In many large-scale settings, utilities are not known in advance, but are instead observed after…

Computer Science and Game Theory · Computer Science 2024-11-06 Elita Lobo , Justin Payan , Cyrus Cousins , Yair Zick