Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.03359

Tight Efficiency Bounds for the Probabilistic Serial and Related Mechanisms

Jugal Garg·Yixin Tao·László A. Végh
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Probabilistic Serial (PS) mechanism -- also known as the simultaneous eating algorithm -- is a canonical solution for the random assignment problem under ordinal preferences. It guarantees envy-freeness and ordinal efficiency in the resulting random assignment. However, under cardinal preferences, its efficiency may degrade significantly: it is known that PS may yield allocations that are $\Omega(\ln{n})$-worse than Pareto optimal, but whether this bound is tight remained an open question. Our first result resolves this question by proving that the PS mechanism guarantees $(\ln n+1)$-approximate Pareto efficiency under cardinal preferences. The key part of our analysis shows that PS achieves a logarithmic $(\ln n + 1)$-approximation to the maximum Nash welfare, in stark contrast to the $O(\sqrt{n})$ loss that can arise in utilitarian social welfare. Our results also extend to the more general submodular setting introduced by Fujishige, Sano, and Zhan (ACM TEAC 2018). In addition, we present a polynomial-time algorithm that computes an allocation which is envy-free and $e^{1/e}$-approximately Pareto-efficient, answering an open question posed by Tr\"obst and Vazirani (EC 2024). The PS mechanism also applies to the allocation of chores instead of goods. We prove that it guarantees an $n$-approximately Pareto-efficient allocation in this setting, and that this bound is asymptotically tight. This result provides the first known approximation guarantee for computing a fair and efficient allocation in the random assignment problem with chores under cardinal preferences.

Explore related subjects

cs.GTecon.TH

Keep this discovery

BibTeXRIS

Jugal Garg, Yixin Tao, László A. Végh. 2025-07-04. Tight Efficiency Bounds for the Probabilistic Serial and Related Mechanisms. https://arxiv.org/abs/2507.03359

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗