English
Related papers

Related papers: Participatory Budget Allocation Method for Approva…

200 papers

Various structured argumentation frameworks utilize preferences as part of their standard inference procedure to enable reasoning with preferences. In this paper, we consider an inverse of the standard reasoning problem, seeking to identify…

Artificial Intelligence · Computer Science 2020-05-13 Quratul-ain Mahesar , Nir Oren , Wamberto W. Vasconcelos

Social choice theory is the study of preference aggregation across a population, used both in mechanism design for human agents and in the democratic alignment of language models. In this study, we propose the representative social choice…

Machine Learning · Computer Science 2025-11-03 Tianyi Qiu

Preferential Bayesian optimization allows optimization of objectives that are either expensive or difficult to measure directly, by relying on a minimal number of comparative evaluations done by a human expert. Generating candidate…

Lu and Boutilier proposed a novel approach based on "minimax regret" to use classical score based voting rules in the setting where preferences can be any partial (instead of complete) orders over the set of alternatives. We show here that…

Multiagent Systems · Computer Science 2017-11-13 Palash Dey

The apportionment problem deals with the fair distribution of a discrete set of $k$ indivisible resources (such as legislative seats) to $n$ entities (such as parties or geographic subdivisions). Highest averages methods are a frequently…

Data Structures and Algorithms · Computer Science 2014-09-10 Zhanpeng Cheng , David Eppstein

Because preferences naturally arise and play an important role in many real-life decisions, they are at the backbone of various fields. In particular preferences are increasingly used in almost all matching procedures-based applications. In…

Artificial Intelligence · Computer Science 2019-03-26 Youssef Hamadi , Souhila Kaci

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

Computer Science and Game Theory · Computer Science 2016-12-01 Pietro Speroni di Fenizio , Daniele A. Gewurz

In the classic apportionment problem the goal is to decide how many seats of a parliament should be allocated to each party as a result of an election. The divisor methods provide a way of solving this problem by defining a notion of…

Optimization and Control · Mathematics 2021-08-10 Claire Mathieu , Victor Verdugo

We consider a voting scenario in which the resource to be voted upon may consist of both indivisible and divisible goods. This setting generalizes both the well-studied model of multiwinner voting and the recently introduced model of cake…

Computer Science and Game Theory · Computer Science 2024-10-14 Xinhang Lu , Jannik Peters , Haris Aziz , Xiaohui Bei , Warut Suksompong

A method is given for determining a mixed social choice out of a paired-comparison matrix. The method combines a projection procedure introduced in previous papers of the same authors and a classical method due to Zermelo. The resulting…

Combinatorics · Mathematics 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class,…

Computer Science and Game Theory · Computer Science 2016-06-01 Jacob Abernethy , Sébastien Lahaie , Matus Telgarsky

This paper examines the optimal organizational rules that govern the process of dividing a fixed surplus. The process is modeled as a sequential multilateral bargaining game with costly recognition. The designer sets the voting rule --…

Theoretical Economics · Economics 2024-11-14 Qiang Fu , Zenan Wu , Yuxuan Zhu

Aggregating preferences under incomplete or constrained feedback is a fundamental problem in social choice and related domains. While prior work has established strong impossibility results for pairwise comparisons, this paper extends the…

Computer Science and Game Theory · Computer Science 2025-02-19 Evi Micha , Vasilis Varsamis

Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all the citizens can be selected with the same probability --…

Computer Science and Game Theory · Computer Science 2024-06-04 Soroush Ebadian , Evi Micha

We study the problem of fairly allocating indivisible items to agents with different entitlements, which captures, for example, the distribution of ministries among political parties in a coalition government. Our focus is on picking…

Computer Science and Game Theory · Computer Science 2021-08-24 Mithun Chakraborty , Ulrike Schmidt-Kraepelin , Warut Suksompong

We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The external party's goal is to make its preferred candidate a…

Computer Science and Game Theory · Computer Science 2010-11-29 Edith Elkind , Piotr Faliszewski

Quadratic Voting (QV) is a social choice mechanism that addresses the "tyranny of the majority" of one-person-one-vote mechanisms. Agents express not only their preference ordering but also their preference intensity by purchasing $x$ votes…

Computer Science and Game Theory · Computer Science 2024-09-11 Laura Georgescu , James Fox , Anna Gautier , Michael Wooldridge

Approval voting is widely used for making multi-winner voting decisions. The canonical rule (also called Approval Voting) used in the setting aims to maximize social welfare by selecting candidates with the highest number of approvals. We…

Computer Science and Game Theory · Computer Science 2026-04-21 Haris Aziz , Yuhang Guo , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

In this work we extend the class of Consensus-Based Optimization (CBO) metaheuristic methods by considering memory effects and a random selection strategy. The proposed algorithm iteratively updates a population of particles according to a…

Optimization and Control · Mathematics 2023-08-16 Giacomo Borghi , Sara Grassi , Lorenzo Pareschi

Current alignment pipelines presume a single, universal notion of desirable behavior. However, human preferences often diverge across users, contexts, and cultures. As a result, disagreement collapses into the majority signal and minority…

Machine Learning · Computer Science 2025-06-10 Daniel Halpern , Evi Micha , Ariel D. Procaccia , Itai Shapira
‹ Prev 1 8 9 10 Next ›