Search arXivSearch

arXiv · 2606.04890

Welfare Maximization in Bilateral Trade: Improved Approximation Guarantees Beyond the Fixed Price Barrier

Abstract

We study the setting of welfare maximization in bilateral trade, where the values of both the buyer and the seller are drawn from independent distributions. Our goal is to maximize social welfare. In this setting, fixed price mechanisms have been extensively studied. In a fixed price mechanism, there is a price $p$ that depends only on the distributions of the buyer and the seller. Trade occurs if and only if the buyer's value is at least $p$ and the seller's value is at most $p$. A long line of work has culminated in determining almost exactly the approximation ratios achievable by fixed price mechanisms: there exists a fixed price mechanism that obtains at least a $0.72$ fraction of the social welfare, but no fixed price mechanism can guarantee more than a $0.7381$ fraction of it [Cai and Wu, STOC'23; Liu, Ren, and Wang, STOC'23]. No other incentive-compatible mechanism is known to beat the performance of fixed-price mechanisms in this setting. This paper shows how to achieve a larger fraction of the optimal welfare with other classes of mechanisms. Specifically, we study the buyer-offering mechanism with a reserve price. In this mechanism, the buyer observes its value and makes a take-it-or-leave-it offer to the seller, where the offer is at least the reserve price. Beyond its simplicity, this natural mechanism is attractive because the seller always has a dominant strategy: accept the offer if its value is at most the offer, and otherwise reject it. We show that there always exists a reserve price that guarantees a $0.746$ fraction of the social welfare. This not only improves upon the best previously known approximation guarantee for the problem, but also demonstrates that fixed-price mechanisms are not optimal in this setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shahar Dobzinski, Ariel Shaulker. 2026-06-03. Welfare Maximization in Bilateral Trade: Improved Approximation Guarantees Beyond the Fixed Price Barrier. https://arxiv.org/abs/2606.04890

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

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT