English
Related papers

Related papers: Distribution Aggregation via Continuous Thiele's R…

200 papers

The probabilistic serial (PS) rule is a prominent randomized rule for assigning indivisible goods to agents. Although it is well known for its good fairness and welfare properties, it is not strategyproof. In view of this, we address…

Computer Science and Game Theory · Computer Science 2015-04-01 Haris Aziz , Serge Gaspers , Simon Mackenzie , Nicholas Mattei , Nina Narodytska , Toby Walsh

We consider existence and uniqueness of Nash equilibria in an $N$-player game of utility maximization under relative performance criteria of multiplicative form in complete semimartingale markets. For a large class of players' utility…

Mathematical Finance · Quantitative Finance 2023-03-15 Anastasiya Tanana

We study a common-pool resource game where the resource experiences failure with a probability that grows with the aggregate investment in the resource. To capture decision making under such uncertainty, we model each player's risk…

Computer Science and Game Theory · Computer Science 2016-07-04 Ashish R. Hota , Siddharth Garg , Shreyas Sundaram

Distributional regression aims at estimating the conditional distribution of a targetvariable given explanatory co-variates. It is a crucial tool for forecasting whena precise uncertainty quantification is required. A popular methodology…

Statistics Theory · Mathematics 2024-11-22 Clément Dombry , Ahmed Zaoui

Several fairness concepts have been proposed recently in attempts to approximate envy-freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to any item (EFX) is arguably the closest to envy-freeness.…

Computer Science and Game Theory · Computer Science 2019-02-13 Ioannis Caragiannis , Nick Gravin , Xin Huang

The classic cake-cutting problem provides a model for addressing fair and efficient allocation of a divisible, heterogeneous resource (metaphorically, the cake) among agents with distinct preferences. Focusing on a standard formulation of…

Computer Science and Game Theory · Computer Science 2021-05-21 Eshwar Ram Arunachaleswaran , Siddharth Barman , Rachitesh Kumar , Nidhi Rathi

Fisher's criterion is a widely used tool in machine learning for feature selection. For large search spaces, Fisher's criterion can provide a scalable solution to select features. A challenging limitation of Fisher's criterion, however, is…

Machine Learning · Computer Science 2022-12-20 Ibrahim Alsolami , Tomoki Fukai

Variational inequality problems allow for capturing an expansive class of problems, including convex optimization problems, convex Nash games and economic equilibrium problems, amongst others. Yet in most practical settings, such problems…

Optimization and Control · Mathematics 2017-02-17 Uma V. Ravat , Uday V. Shanbhag

We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of $n \le x$ for which the Alladi-Erd\H{o}s function $A(n) =…

Number Theory · Mathematics 2025-08-13 Paul Pollack , Akash Singha Roy

We consider the problem of optimal charging of plug-in electric vehicles (PEVs). We treat this problem as a multi-agent game, where vehicles/agents are heterogeneous since they are subject to possibly different constraints. Under the…

Optimization and Control · Mathematics 2018-10-18 Luca Deori , Kostas Margellos , Maria Prandini

We consider the classic problem of fairly allocating indivisible goods among agents with additive valuation functions and explore the connection between two prominent fairness notions: maximum Nash welfare (MNW) and envy-freeness up to any…

Computer Science and Game Theory · Computer Science 2022-09-12 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros Hollender , Alexandros A. Voudouris

Multi-agent games are becoming an increasing prevalent formalism for the study of electronic commerce and auctions. The speed at which transactions can take place and the growing complexity of electronic marketplaces makes the study of…

Computer Science and Game Theory · Computer Science 2013-01-18 Satinder Singh , Michael Kearns , Yishay Mansour

We study a new class of so-called rational-infinitely (or quasi-infinitely) divisible probability laws on the real line. The characteristic functions of these distributions are ratios of the characteristic functions of classical infinitely…

Probability · Mathematics 2025-10-29 Alexey Khartov

We propose a new family of fairness definitions for classification problems that combine some of the best properties of both statistical and individual notions of fairness. We posit not only a distribution over individuals, but also a…

Machine Learning · Computer Science 2019-12-18 Michael Kearns , Aaron Roth , Saeed Sharifi-Malvajerdi

For effective matching of resources (e.g., taxis, food, bikes, shopping items) to customer demand, aggregation systems have been extremely successful. In aggregation systems, a central entity (e.g., Uber, Food Panda, Ofo) aggregates supply…

Machine Learning · Computer Science 2020-03-17 Tanvi Verma , Pradeep Varakantham

We study the problem of allocating a set of indivisible items to agents with additive utilities to maximize the Nash social welfare. Cole and Gkatzelis recently proved that this problem admits a constant factor approximation. We complement…

Computational Complexity · Computer Science 2015-07-07 Euiwoong Lee

We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in identifying a winning committee for the second stage that…

Computer Science and Game Theory · Computer Science 2024-08-21 Valentin Zech , Niclas Boehmer , Edith Elkind , Nicholas Teh

In order to develop certain fractional probabilistic analogues of Taylor's theorem and mean value theorem, we introduce the nth-order fractional equilibrium distribution in terms of the Weyl fractional integral and investigate its main…

Probability · Mathematics 2016-11-08 Antonio Di Crescenzo , Alessandra Meoli

We study correlated equilibria and coarse equilibria of simple first-price single-item auctions in the simplest auction model of full information. Nash equilibria are known to always yield full efficiency and a revenue that is at least the…

Computer Science and Game Theory · Computer Science 2017-01-09 Michal Feldman , Brendan Lucier , Noam Nisan

In this letter, we study distributed optimization and Nash equilibrium-seeking dynamics from a contraction theoretic perspective. Our first result is a novel bound on the logarithmic norm of saddle matrices. Second, for distributed gradient…

Optimization and Control · Mathematics 2023-09-25 Anand Gokhale , Alexander Davydov , Francesco Bullo