English
Related papers

Related papers: Anonymous voting in a heterogeneous society

200 papers

We consider a distributed voting problem with a set of agents that are partitioned into disjoint groups and a set of obnoxious alternatives. Agents and alternatives are represented by points in a metric space. The goal is to compute the…

Computer Science and Game Theory · Computer Science 2024-12-17 Alexandros A. Voudouris

Are there voting methods which (i) give everyone, including minorities, an equal share of effective power even if voters act strategically, (ii) promote consensus rather than polarization and inequality, and (iii) do not favour the status…

General Economics · Economics 2020-06-12 Jobst Heitzig , Forest W. Simmons

Consideration was given to a model of social dynamics controlled by successive collective decisions based on the threshold majority procedures. The current system state is characterized by the vector of participants' capitals (utilities).…

Optimization and Control · Mathematics 2009-02-27 V. I. Borzenko , Z. M. Lezina , A. K. Loginov , Ya. Yu. Tsodikova , P. Yu. Chebotarev

In a voting problem with a finite set of alternatives to choose from, we study the manipulation of tops-only rules. Since all non-dictatorial (onto) voting rules are manipulable when there are more than two alternatives and all preferences…

Theoretical Economics · Economics 2022-10-24 R. Pablo Arribillaga , Agustin G. Bonifacio

We revisit the well-studied problem of designing mechanisms for one-sided matching markets, where a set of $n$ agents needs to be matched to a set of $n$ heterogeneous items. Each agent $i$ has a value $v_{i,j}$ for each item $j$, and these…

Computer Science and Game Theory · Computer Science 2020-01-22 Rediet Abebe , Richard Cole , Vasilis Gkatzelis , Jason D. Hartline

A group of privately informed agents chooses between two alternatives. How should the decision rule be designed if agents are known to be biased in favor of one of the options? We address this question by considering the Condorcet Jury…

Theoretical Economics · Economics 2026-01-27 Deniz Kattwinkel , Alexander Winter

We study the set of incentive compatible and efficient two-sided matching mechanisms. We classify all such mechanisms under an additional assumption -- "gender-neutrality" -- which guarantees that the two sides be treated symmetrically. All…

Theoretical Economics · Economics 2023-01-31 Sophie Bade , Joseph Root

Two agents trade an item in a simultaneous offer setting, where the exchange takes place if and only if the buyer's bid price weakly exceeds the seller's ask price. Each agent is randomly assigned the buyer or seller role. Both agents are…

Theoretical Economics · Economics 2025-05-29 José Ignacio Rivero-Wildemauwe

In frequently repeated matching scenarios, individuals may require diversification in their choices. Therefore, when faced with a set of potential outcomes, each individual may have an ideal lottery over outcomes that represents their…

Computer Science and Game Theory · Computer Science 2024-04-29 Rasoul Ramezanian

Altruistic behaviour is disadvantageous for the individual while is advantageous for its group. If the target of the selection is the individual, one would expect the selection process to lead to populations formed by wholly homogeneous…

adap-org · Physics 2008-02-03 R. Donato , L. Peliti , M. Serva

I study the optimal voting mechanism for a committee that must decide whether to enact or block a policy of unknown benefit. Information can come both from committee members who can acquire it at cost, and a strategic lobbyist who wishes…

Theoretical Economics · Economics 2025-08-04 D. Carlos Akkar

We study a scenario where an adjudication task (e.g., the resolution of a binary dispute) is outsourced to a set of agents who are appointed as jurors. This scenario is particularly relevant in a Web3 environment, where no verification of…

Computer Science and Game Theory · Computer Science 2023-01-24 Ioannis Caragiannis , Nikolaj I. Schwartzbach

Aggregating the preferences of individuals into a collective decision is the core subject of study of social choice theory. In 2006, Procaccia and Rosenschein considered a utilitarian social choice setting, where the agents have explicit…

Computer Science and Game Theory · Computer Science 2021-04-16 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric. We assume that these costs are unknown to…

Artificial Intelligence · Computer Science 2016-09-27 Elliot Anshelevich , John Postl

We present numerical simulations of a model of social influence, where the opinion of each agent is represented by a binary vector. Agents adjust their opinions as a result of random encounters, whenever the difference between opinions is…

Statistical Mechanics · Physics 2009-11-10 M. F. Laguna , Guillermo Abramson , Damian H. Zanette

We consider multi-agent systems where agents' preferences are aggregated via sequential majority voting: each decision is taken by performing a sequence of pairwise comparisons where each comparison is a weighted majority vote among the…

Artificial Intelligence · Computer Science 2012-04-18 Maria Pini , Francesca Rossi , Brent Venable , Toby Walsh

We initiate the study of the heterogeneous facility location problem with limited resources. We mainly focus on the fundamental case where a set of agents are positioned in the line segment [0,1] and have approval preferences over two…

Computer Science and Game Theory · Computer Science 2021-05-07 Argyrios Deligkas , Aris Filos-Ratsikas , Alexandros A. Voudouris

Perpetual voting studies fair collective decision-making in settings where many decisions are to be made, and is a natural framework for settings such as parliaments and the running of blockchain Decentralized Autonomous Organizations…

Computer Science and Game Theory · Computer Science 2024-08-19 Yotam Gafni , Ben Golan

Decision procedures aggregating the preferences of multiple agents can produce cycles and hence outcomes which have been described heuristically as `chaotic'. We make this description precise by constructing an explicit dynamical system…

Statistical Mechanics · Physics 2009-10-31 David A. Meyer , Thad A. Brown

We investigate an averaging process that describes how interacting agents approach consensus through binary interactions. In each elementary step, two agents are selected at random and they reach compromise by adopting their opinion…

Statistical Mechanics · Physics 2021-11-23 E. Ben-Naim , P. L. Krapivsky