Showing 1 - 10 of 25
Persistent link: https://www.econbiz.de/10005364720
In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believe the portions are equally split. Moreover, the division takes at most n cuts, which is best possible. This extends...
Persistent link: https://www.econbiz.de/10011569033
In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believe the portions are equally split. Moreover, the division takes at most n cuts, which is best possible. This extends...
Persistent link: https://www.econbiz.de/10010334625
Persistent link: https://www.econbiz.de/10009500127
Are there collective decision methods which (i) give everyone, including minorities, an equal share of effective power even if voters act strategically, (ii) promote consensus and equality, rather than polarization and inequality, and (iii) do not favour the status quo or rely too much on...
Persistent link: https://www.econbiz.de/10013242304
Persistent link: https://www.econbiz.de/10009808470
We introduce the following basic voting method: voters submit both a “consensus” and a “fall-back” ballot. If all “consensus” ballots name the same option, it wins; otherwise, a randomly drawn “fall-back” ballot decides. If there is one potential consensus option that everyone...
Persistent link: https://www.econbiz.de/10014177417
In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believe the portions are equally split. Moreover, the division takes at most n cuts, which is best possible. This extends...
Persistent link: https://www.econbiz.de/10005453651
Every weighted tree corresponds naturally to a cooperative game that we call a tree game; it assigns to each subset of leaves the sum of the weights of the minimal subtree spanned by those leaves. In the context of phylogenetic trees, the leaves are species and this assignment captures the...
Persistent link: https://www.econbiz.de/10010272590
In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of...
Persistent link: https://www.econbiz.de/10010272612