Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity

09/25/2020
by   Komal Malik, et al.
0

We consider a combinatorial auction model where preferences of agents over bundles of objects and payments need not be quasilinear. However, we restrict the preferences of agents to be dichotomous. An agent with dichotomous preference partitions the set of bundles of objects as acceptable and unacceptable, and at the same payment level, she is indifferent between bundles in each class but strictly prefers acceptable to unacceptable bundles. We show that there is no Pareto efficient, dominant strategy incentive compatible (DSIC), individually rational (IR) mechanism satisfying no subsidy if the domain of preferences includes all dichotomous preferences. However, a generalization of the VCG mechanism is Pareto efficient, DSIC, IR and satisfies no subsidy if the domain of preferences contains only positive income effect dichotomous preferences. We show the tightness of this result: adding any non-dichotomous preference (satisfying some natural properties) to the domain of quasilinear dichotomous preferences brings back the impossibility result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2020

Learning Desirable Matchings From Partial Preferences

We study the classic problem of matching n agents to n objects, where th...
research
02/14/2012

An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information

We study the problem of agent-based negotiation in combinatorial domains...
research
10/26/2019

Almost Quasi-linear Utilities in Disguise: Positive-representation An Extension of Roberts' Theorem

This work deals with the implementation of social choice rules using dom...
research
07/25/2022

Modelling non-reinforced preferences using selective attention

How can artificial agents learn non-reinforced preferences to continuous...
research
07/15/2018

The Temporary Exchange Problem

We formalize an allocation model under ordinal preferences that is more ...
research
06/06/2021

Individually Rational Land and Neighbor Allocation: Impossibility Results

We consider a setting in which agents are allocated land plots and they ...
research
07/21/2019

False-Name-Proof Facility Location on Discrete Structures

We consider the problem of locating a single facility on a vertex in a g...

Please sign up or login with your details

Forgot password? Click here to reset