Barter Exchange with Bounded Trading Cycles

TL;DR

This paper studies a barter exchange problem with bounded trading cycles, focusing on designing truthful, efficient mechanisms that approximate optimal social welfare, even when exact solutions are computationally infeasible.

Contribution

It introduces a truthful local search algorithm for bounded cycle barter exchanges, providing approximation bounds and extending to general length functions.

Findings

Developed a truthful local search-based mechanism.

Provided bounds on approximation ratios based on cycle length bounds.

Extended results to general length functions () with monotonicity.

Abstract

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 the items to the agents such that each agent either keeps her own item or receives an item from her (reported) wish list, subject to the constraint that the length of the trading cycles induced by the allocation is up-bounded by a prespecified length bound k. The utility of an agent from an allocation is 1 if she receives an item from her (true) wish list and 0 if she keeps her own item (the agent incurs a large dis-utility if she receives an item that is neither hers nor belongs to her wish list). In this paper, we investigate the aforementioned barter exchange problem from the perspective of mechanism design without money, aiming for truthful (and individually rational) mechanisms whose objective is to maximize the social welfare. As the construction of a social welfare maximizing allocation is computationally intractable for length bounds k \geq 3, this paper focuses on (computationally efficient) truthful mechanisms that approximate the (combinatorially) optimal social welfare.We also study a more general version of the barter exchange problem, where the utility of an agent from participating in a trading cycle of length 2 \leq \ell \leq k is lambda(\ell), where \lambda is a general (monotonically non-increasing) length function. Our results include upper and lower bounds on the guaranteed approximation ratio, expressed in terms of the length bound k and the length function \lambda. On the technical side, our main contribution is an algorithmic tool that can be viewed as a truthful version of the local search paradigm. As it turns out, this tool can be applied to more general (bounded size) coalition formation problems.