English
Related papers

Related papers: Truthful Aggregation of Budget Proposals with Prop…

200 papers

Distributed aggregative optimization methods are gaining increased traction due to their ability to address cooperative control and optimization problems, where the objective function of each agent depends not only on its own decision…

Multiagent Systems · Computer Science 2025-06-03 Ziqin Chen , Magnus Egerstedt , Yongqiang Wang

A quota mechanism, such as a mandatory grading curve, links together multiple decisions. We analyze the performance of quota mechanisms when the number of linked decisions is finite and the designer has imperfect knowledge of the type…

Theoretical Economics · Economics 2026-04-10 Ian Ball , Deniz Kattwinkel

Distribution-free uncertainty estimation for ensemble methods is increasingly desirable due to the widening deployment of multi-modal black-box predictive models. Conformal prediction is one approach that avoids such distributional…

Methodology · Statistics 2025-05-26 Eduardo Ochoa Rivera , Yash Patel , Ambuj Tewari

We consider the scheduling problem on $n$ strategic unrelated machines when no payments are allowed, under the objective of minimizing the makespan. We adopt the model introduced in [Koutsoupias, Theory Comput. Syst. (2014)] where a machine…

Computer Science and Game Theory · Computer Science 2018-12-05 Yiannis Giannakopoulos , Elias Koutsoupias , Maria Kyropoulou

In this paper, we study the problem of estimating uniformly well the mean values of several distributions given a finite budget of samples. If the variance of the distributions were known, one could design an optimal sampling strategy by…

Machine Learning · Computer Science 2015-07-17 Alexandra Carpentier , Alessandro Lazaric , Mohammad Ghavamzadeh , Rémi Munos , Peter Auer , András Antos

We consider a stylized formal model of public transportation, where a set of agents need to travel along a given road, and there is a bus that runs the length of this road. Each agent has a left terminal and a right terminal between which…

Computer Science and Game Theory · Computer Science 2025-09-24 Martin Bullinger , Edith Elkind , Mohamad Latifian

We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same group share the same set of goods even though they may have different preferences. Previous work has focused on unanimous fairness, in which…

Computer Science and Game Theory · Computer Science 2020-01-01 Erel Segal-Halevi , Warut Suksompong

Optimal mechanisms have been provided in quite general multi-item settings, as long as each bidder's type distribution is given explicitly by listing every type in the support along with its associated probability. In the implicit setting,…

Computer Science and Game Theory · Computer Science 2015-03-09 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

We present a statistical testing framework to detect if a given machine learning classifier fails to satisfy a wide range of group fairness notions. The proposed test is a flexible, interpretable, and statistically rigorous tool for…

Machine Learning · Statistics 2021-06-03 Nian Si , Karthyek Murthy , Jose Blanchet , Viet Anh Nguyen

The budget is the key means for effecting policy in democracies, yet its preparation is typically an excluding, opaque, and arcane process. We aim to rectify this by providing for the democratic creation of complete budgets --- for…

Computer Science and Game Theory · Computer Science 2018-06-21 Ehud Shapiro , Nimrod Talmon

In this paper, we present a study of a mobility game with uncertainty in the decision-making of travelers and incorporate prospect theory to model travel behavior. We formulate a mobility game that models how travelers distribute their…

Systems and Control · Electrical Eng. & Systems 2024-03-20 Ioannis Vasileios Chremos , Heeseung Bang , Aditya Dave , Viet-Anh Le , Andreas A. Malikopoulos

This paper is motivated by recent research in the $d$-dimensional stochastic linear bandit literature, which has revealed an unsettling discrepancy: algorithms like Thompson sampling and Greedy demonstrate promising empirical performance,…

Machine Learning · Computer Science 2025-05-20 Yuwei Luo , Mohsen Bayati

Thompson Sampling is one of the most widely used and studied bandit algorithms, known for its simple structure, low regret performance, and solid theoretical guarantees. Yet, in stark contrast to most other families of bandit algorithms,…

Machine Learning · Computer Science 2026-05-28 Yanlin Qu , Hongseok Namkoong , Assaf Zeevi

We study a problem where a group of agents has to decide how a joint reward should be shared among them. We focus on settings where the share that each agent receives depends on the subjective opinions of its peers concerning that agent's…

Computer Science and Game Theory · Computer Science 2013-05-23 Arthur Carvalho , Kate Larson

We study a class of elections in which the input format is trichotomous and allows voters to elicit their negative feelings explicitly. In particular, we study multiwinner elections with a special proclivity to elect proportionally…

Computer Science and Game Theory · Computer Science 2021-01-14 Nimrod Talmon , Rutvik Page

Optimal mechanism design enjoys a beautiful and well-developed theory, and also a number of killer applications. Rules of thumb produced by the field influence everything from how governments sell wireless spectrum licenses to how the major…

Computer Science and Game Theory · Computer Science 2014-09-23 Tim Roughgarden

Parallel machine scheduling has been extensively studied in the past decades, with applications ranging from production planning to job processing in large computing clusters. In this work we study some of these fundamental optimization…

Data Structures and Algorithms · Computer Science 2015-09-08 Yael Mordechai

We study the problem of fairly allocating indivisible goods and focus on the classic fairness notion of proportionality. The indivisibility of the goods is long known to pose highly non-trivial obstacles to achieving fairness, and a very…

Computer Science and Game Theory · Computer Science 2021-01-15 Artem Baklanov , Pranav Garimidi , Vasilis Gkatzelis , Daniel Schoepflin

We study the efficiency guarantees in the simple auction environment where the auctioneer has one unit of divisible good to be distributed among a number of budget constrained agents. With budget constraints, the social welfare cannot be…

Computer Science and Game Theory · Computer Science 2015-02-16 Pinyan Lu , Tao Xiao

In participatory budgeting (PB), voters decide through voting which subset of projects to fund within a given budget. Proportionality in the context of PB is crucial to ensure equal treatment of all groups of voters. However, pure…

Computer Science and Game Theory · Computer Science 2025-07-08 Georgios Papasotiropoulos , Seyedeh Zeinab Pishbin , Oskar Skibski , Piotr Skowron , Tomasz Wąs