activity
20102020
most citedStable partitions in additively separable hedonic games

112 citations · 257 across the 5 of their papers we have counts for

collaborators

7 papers

econ.TH2020★ 22 cited

On the Structure of Stable Tournament Solutions

Felix Brandt, Markus Brill, Hans Georg Seedig +1

A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We prov…

cs.GT2017

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters

Georg Bachmeier, Felix Brandt, Christian Geist +4

Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. How…

cs.GT2015

Consistent Probabilistic Social Choice

Florian Brandl, Felix Brandt, Hans Georg Seedig

Two fundamental axioms in social choice theory are consistency with respect to a variable electorate and consistency with respect to components of similar alternatives. In the cont…

cs.GT2015★ 2 cited

On the Susceptibility of the Deferred Acceptance Algorithm

Haris Aziz, Hans Georg Seedig, Jana Karina von Wedel

The Deferred Acceptance Algorithm (DAA) is the most widely accepted and used algorithm to match students, workers, or residents to colleges, firms or hospitals respectively. In thi…

cs.MA2013★ 9 cited

A tournament of order 24 with two disjoint TEQ-retentive sets

Felix Brandt, Hans Georg Seedig

Brandt et al. (2013) have recently disproved a conjecture by Schwartz (1990) by non-constructively showing the existence of a counterexample with about 10^136 alternatives. We prov…

cs.GT2010★ 112 cited

Stable partitions in additively separable hedonic games

Haris Aziz, Felix Brandt, Hans Georg Seedig

An important aspect in systems of multiple autonomous agents is the exploitation of synergies via coalition formation. In this paper, we solve various open problems concerning the…

cs.GT2010★ 112 cited

Optimal Partitions in Additively Separable Hedonic Games

Haris Aziz, Felix Brandt, Hans Georg Seedig

We conduct a computational analysis of fair and optimal partitions in additively separable hedonic games. We show that, for strict preferences, a Pareto optimal partition can be fo…