Private Interdependent Valuations

by   Alon Eden, et al.

We consider the single-item interdependent value setting, where there is a monopolist, n buyers, and each buyer has a private signal s_i describing a piece of information about the item. Each bidder i also has a valuation function v_i(s_1,…,s_n) mapping the (private) signals of all buyers to a positive real number representing their value for the item. This setting captures scenarios where the item's information is asymmetric or dispersed among agents, such as in competitions for oil drilling rights, or in auctions for art pieces. Due to the increased complexity of this model compared to standard private values, it is generally assumed that each bidder's valuation function v_i is public knowledge. But in many situations, the seller may not know how a bidder aggregates signals into a valuation. In this paper, we design mechanisms that guarantee approximately-optimal social welfare while satisfying ex-post incentive compatibility and individual rationality for the case where the valuation functions are private to the bidders. When the valuations are public, it is possible for optimal social welfare to be attained by a deterministic mechanism under a single-crossing condition. In contrast, when the valuations are the bidders' private information, we show that no finite bound can be achieved by any deterministic mechanism even under single-crossing. Moreover, no randomized mechanism can guarantee better than an n-approximation. We thus consider valuation functions that are submodular over signals (SOS), introduced in the context of combinatorial auctions in a recent breakthrough paper by Eden et al. [EC'19]. Our main result is an O(log^2 n)-approximation for buyers with private signals and valuations under the SOS condition. We also give a tight Θ(k)-approximation for the case each agent's valuation depends on at most k other signals even for unknown k.



page 1

page 2

page 3

page 4


Interdependent Values without Single-Crossing

We consider a setting where an auctioneer sells a single item to n poten...

Auctions with Interdependence and SOS: Improved Approximation

Interdependent values make basic auction design tasks – in particular ma...

Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue

We study combinatorial auctions with interdependent valuations. In such ...

Interdependent Public Projects

In the interdependent values (IDV) model introduced by Milgrom and Weber...

Signaling in Posted Price Auctions

We study single-item single-unit Bayesian posted price auctions, where b...

Mechanism Design without Money for Common Goods

We initiate the study of mechanism design without money for common goods...

Multi-unit Bilateral Trade

We characterise the set of dominant strategy incentive compatible (DSIC)...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.