English
Related papers

Related papers: Approximate Strategyproofness in Approval-based Bu…

200 papers

We study the problem of maximizing Nash social welfare, which is the geometric mean of agents' utilities, in two well-known models. The first model involves one-sided preferences, where a set of indivisible items is allocated among a group…

Computer Science and Game Theory · Computer Science 2025-05-19 Salil Gokhale , Harshul Sagar , Rohit Vaish , Vignesh Viswanathan , Jatin Yadav

We generalize the classic problem of fairly allocating indivisible goods to the problem of \emph{fair public decision making}, in which a decision must be made on several social issues simultaneously, and, unlike the classic setting, a…

Computer Science and Game Theory · Computer Science 2017-06-01 Vincent Conitzer , Rupert Freeman , Nisarg Shah

The notion of \emph{envy-freeness} is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guaranteed to exist. Classical works have avoided this issue by…

Computer Science and Game Theory · Computer Science 2021-05-06 Hiromichi Goko , Ayumi Igarashi , Yasushi Kawase , Kazuhisa Makino , Hanna Sumita , Akihisa Tamura , Yu Yokoi , Makoto Yokoo

We consider strategy proof mechanisms for facility location which maximize equitability between agents. As is common in the literature, we measure equitability with the Gini index. We first prove a simple but fundamental impossibility…

Computer Science and Game Theory · Computer Science 2025-06-13 Toby Walsh

We study Markov potential games under the infinite horizon average reward criterion. Most previous studies have been for discounted rewards. We prove that both algorithms based on independent policy gradient and independent natural policy…

Machine Learning · Computer Science 2024-03-12 Min Cheng , Ruida Zhou , P. R. Kumar , Chao Tian

We study the problem of allocating indivisible goods among agents in a fair and economically efficient manner. In this context, the Nash social welfare-defined as the geometric mean of agents' valuations for their assigned bundles-stands as…

Computer Science and Game Theory · Computer Science 2021-10-27 Siddharth Barman , Paritosh Verma

The problem of distributed rate maximization in multi-channel ALOHA networks is considered. First, we study the problem of constrained distributed rate maximization, where user rates are subject to total transmission probability…

Networking and Internet Architecture · Computer Science 2015-05-25 Kobi Cohen , Amir Leshem

We consider the problem of maximizing the Nash social welfare when allocating a set $\mathcal{G}$ of indivisible goods to a set $\mathcal{N}$ of agents. We study instances, in which all agents have 2-value additive valuations: The value of…

Lindahl equilibrium is a solution concept for allocating a fixed budget across several divisible public goods. It always lies in the weak core, meaning that the equilibrium allocation satisfies desirable stability and proportional fairness…

Computer Science and Game Theory · Computer Science 2025-09-08 Christian Kroer , Dominik Peters

Prophet inequality concerns a basic optimal stopping problem and states that simple threshold stopping policies -- i.e., accepting the first reward larger than a certain threshold -- can achieve tight $\frac{1}{2}$-approximation to the…

Computer Science and Game Theory · Computer Science 2024-10-31 Wei Tang , Haifeng Xu , Ruimin Zhang , Derek Zhu

We formulate two-party policy competition as a two-player non-cooperative game, generalizing Lin et al.'s work (2021). Each party selects a real-valued policy vector as its strategy from a compact subset of Euclidean space, and a voter's…

Computer Science and Game Theory · Computer Science 2026-03-19 Chuang-Chieh Lin , Chi-Jen Lu , Po-An Chen , Chih-Chieh Hung

Sequential allocation is a simple mechanism for sharing multiple indivisible items. We study strategic behavior in sequential allocation. In particular, we consider Nash dynamics, as well as the computation and Pareto optimality of pure…

Computer Science and Game Theory · Computer Science 2017-05-29 Haris Aziz , Paul Goldberg , Toby Walsh

In the allocation of indivisible goods, the maximum Nash welfare (MNW) rule, which chooses an allocation maximizing the product of the agents' utilities, has received substantial attention for its fairness. We characterize MNW as the only…

Theoretical Economics · Economics 2022-12-20 Warut Suksompong

We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that each agent has i.i.d. values for the item across rounds, and…

Computer Science and Game Theory · Computer Science 2025-11-07 David X. Lin , Siddhartha Banerjee , Giannis Fikioris , Éva Tardos

In this paper, we present new results on the fair and efficient allocation of indivisible goods to agents whose preferences correspond to {\em matroid rank functions}. This is a versatile valuation class with several desirable properties…

Artificial Intelligence · Computer Science 2021-06-21 Nawal Benabbou , Mithun Chakraborty , Ayumi Igarashi , Yair Zick

The Adjusted Winner procedure is an important fair division mechanism proposed by Brams and Taylor for allocating goods between two parties. It has been used in practice for divorce settlements and analyzing political disputes. Assuming…

Computer Science and Game Theory · Computer Science 2017-03-01 Haris Aziz , Simina Brânzei , Aris Filos-Ratsikas , Søren Kristoffer Stiil Frederiksen

We study optimal transport-based distributionally robust optimization problems where a fictitious adversary, often envisioned as nature, can choose the distribution of the uncertain problem parameters by reshaping a prescribed reference…

Optimization and Control · Mathematics 2025-10-16 Soroosh Shafiee , Liviu Aolaritei , Florian Dörfler , Daniel Kuhn

This paper revisits the limitations of the Median Voter Theorem and introduces a novel framework to analyze the optimal economic ideological positions of political parties. By incorporating Nash equilibrium, we examine the mechanisms and…

General Economics · Economics 2025-02-11 Shitong Wang

We study a fundamental problem in optimization under uncertainty. There are $n$ boxes; each box $i$ contains a hidden reward $x_i$. Rewards are drawn i.i.d. from an unknown distribution $\mathcal{D}$. For each box $i$, we see $y_i$, an…

Computer Science and Game Theory · Computer Science 2023-07-13 Kamyar Azizzadenesheli , Trung Dang , Aranyak Mehta , Alexandros Psomas , Qian Zhang

We study a general scenario of simultaneous contests that allocate prizes based on equal sharing: each contest awards its prize to all players who satisfy some contest-specific criterion, and the value of this prize to a winner decreases as…

Computer Science and Game Theory · Computer Science 2022-07-19 Edith Elkind , Abheek Ghosh , Paul W. Goldberg