Baryshnikov presented a remarkable algebraic topology proof of Arrow's impossibility
theorem trying to understand the underlying reason behind the numerous proofs of this …

We introduce a new axiom called bounded response, which states that for each “smallest”
change of a preference profile, the change in the social choice must be “smallest,” if any, for …

The 2020 Olympic Games in Tokyo will inaugurate ten new gold medals; one male and one
female in each of five new events: karate, skateboarding, surfing, baseball and sports …

We propose a new axiom called bounded response, which says that the smallest change in
an agent's preference leads to the smallest or no change in the aggregated preference in …

The purpose of this correlational quantitative study was to examine the possible relationship
between user-driven parameters, user ratings, and ranking algorithms. The study's …

A one-shot proof of Arrow’s theorem and the Gibbard–Satterthwaite theorem | SpringerLink Skip
to main content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search …

Manipulation of indirect elections by vote pairing occurs when a group of voters in different
electoral bodies secures a jointly preferred winner by performing pairwise exchanges of …

Wir untersuchen verschiedene Fragestellungen der Sozialwahltheorie aus Sicht der
Computational Social Choice. Für ein Problem, das in Bezug zu einem Kollektiv von …

The problem of social choice is studied on a domain with countably many individuals. In
contrast to most of the existing literature which establish either non-constructive possibilities …

The problem of social choice concerns aggregating multiple, perhaps conflicting
preferences into a collective preferences or outcome. We consider how the information …