English
Related papers

Related papers: Weighted Committee Games

200 papers

We consider a simple and altruistic multiagent system in which the agents are eager to perform a collective task but where their real engagement depends on the willingness to perform the task of other influential agents. We model this…

Computer Science and Game Theory · Computer Science 2014-03-10 Xavier Molinero , Fabián Riquelme , Maria Serna

Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…

Combinatorics · Mathematics 2021-01-29 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences…

Combinatorics · Mathematics 2010-07-13 Mike Develin , Sam Payne

We compare different actual forms of democracy and analyse in which way they are variations of a 'natural consensus decision process'. We analyse how 'consensus decision followed by majority voting' is open to 'false play' by the majority,…

Physics and Society · Physics 2010-04-16 Diederik Aerts

We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…

Optimization and Control · Mathematics 2015-10-22 Sylvain Sorin , Cheng Wan

We define a notion of the criticality of a player for simple monotone games based on cooperation with other players, either to form a winning coalition or to break a winning one, with an essential role for all the players involved. We…

Theoretical Economics · Economics 2024-07-29 Michele Aleandri , Marco Dall'Aglio

We introduce a new class of population games that we call monotropic; these are games characterized by the presence of a unique globally neutrally stable Nash equilibrium. Monotropic games generalize strictly concave potential games and…

Computer Science and Game Theory · Computer Science 2014-04-22 Ioannis Avramopoulos

Committee selection with diversity or distributional constraints is a ubiquitous problem. However, many of the formal approaches proposed so far have certain drawbacks including (1) computationally intractability in general, and (2)…

Artificial Intelligence · Computer Science 2018-04-02 Haris Aziz

We consider iterative voting models and position them within the general framework of acyclic games and game forms. More specifically, we classify convergence results based on the underlying assumptions on the agent scheduler (the order of…

Multiagent Systems · Computer Science 2018-08-13 Reshef Meir , Maria Polukarov , Jeffrey S. Rosenschein , Nicholas R. Jennings

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

Statistical Mechanics · Physics 2007-05-23 F. K. Chow , H. F. Chau

Like many other voting systems, Majority Judgement suffers from the weaknesses of the underlying mathematical model: Elections as problem of choice or ranking. We show how the model can be enhanced to take into account the complete process…

Computer Science and Game Theory · Computer Science 2023-07-07 Friedemann Kemm

The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to create any outcome between strictly majoritarian and purely proportional seat allocation. It contains vote…

Computer Science and Game Theory · Computer Science 2017-10-27 László Csató

Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…

Computer Science and Game Theory · Computer Science 2023-10-31 Prem Kant , Urban Larsson , Ravi K. Rai , Akshay V. Upasany

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek

Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…

Probability · Mathematics 2007-05-23 Olle Haggstrom , Gil Kalai , Elchanan Mossel

We analyse optimal voting weights in two-tier voting systems. In our model, the overall population (or union) is split in groups (or member states) of different sizes. The individuals comprising the overall population constitute the first…

Probability · Mathematics 2022-09-28 Werner Kirsch , Gabor Toth

In observational causal inference, in order to emulate a randomized experiment, weights are used to render treatments independent of observed covariates. This property is known as balance; in its absence, estimated causal effects may be…

Methodology · Statistics 2020-07-16 David Arbour , Drew Dimmery , Arjun Sondhi

Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents…

Computer Science and Game Theory · Computer Science 2012-07-17 Simina Brânzei , Tomasz P. Michalak , Talal Rahwan , Kate Larson , Nicholas R. Jennings

Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel
‹ Prev 1 4 5 6 7 8 10 Next ›