SearcharxivSearch

arXiv · 2608.11351

Welfare Approximation in Multilateral Trade

Abstract

We introduce the study of \emph{multilateral trade}: a mechanism-design problem in which a single potential trade involves $k$ agents and can be executed only if all $k$ agents agree to participate. The classical case $k=2$ is the well-studied bilateral trade problem, where a seller and a buyer with private values must decide whether to trade an item initially held by the seller. Existing extensions of bilateral trade have largely focused on markets with many buyers and many sellers, but where each realized transaction is still bilateral, requiring agreement only between the matched buyer and seller. Our formulation captures settings in which the trade itself requires joint participation, coupling the agents' incentives and creating new challenges. We study welfare approximation in this setting under incentive compatibility, individual rationality, and budget balance. We give a DSIC mechanism with approximation ratio $O(k^2)$, and a BIC mechanism with approximation ratio $\widetilde O(k^{3/2})$. We prove matching lower bounds up to polylogarithmic factors. Finally, we extend the model to an $\ell$-out-of-$k$ partial-agreement setting, where the trade may occur once at least $\ell$ agents participate. In this relaxed model, the welfare guarantees improve smoothly as $k-\ell$, the number of agents whose participation is not required, grows, and we obtain matching upper and lower bounds up to polylogarithmic factors.

Explore related subjects

Keep this discovery

BibTeXRIS

Tomer Ezra, Aadityan Ganesh, Aviad Rubinstein. 2026-08-11. Welfare Approximation in Multilateral Trade. https://arxiv.org/abs/2608.11351

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT