Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Seedig, Hans Georg"'
Publikováno v:
Economic Theory, 65(2):483-507 (2018)
A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insights that improve our understanding of stab
Externí odkaz:
http://arxiv.org/abs/2004.01651
Autor:
Bachmeier, Georg, Brandt, Felix, Geist, Christian, Harrenstein, Paul, Kardel, Keyvan, Peters, Dominik, Seedig, Hans Georg
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. However, this fact requires a number of voters that is almost linear in t
Externí odkaz:
http://arxiv.org/abs/1704.06304
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 this paper, we consider for the first time, the complexity of manipulatin
Externí odkaz:
http://arxiv.org/abs/1502.06318
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 context of traditional non-probabilistic social choice, these axioms are i
Externí odkaz:
http://arxiv.org/abs/1503.00694
Autor:
Brandt, Felix, Seedig, Hans Georg
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 provide a concrete counterexample for Schwartz's conjecture with only 24 a
Externí odkaz:
http://arxiv.org/abs/1302.5592
Autor:
Bachmeier, Georg, Brandt, Felix, Geist, Christian, Harrenstein, Paul, Kardel, Keyvan, Peters, Dominik, Seedig, Hans Georg
Publikováno v:
In Journal of Computer and System Sciences November 2019 105:130-157
Publikováno v:
Artificial Intelligence 195, 2013
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 computational complexity of stable partitions in additively separable
Externí odkaz:
http://arxiv.org/abs/1008.0074
Publikováno v:
Artificial Intelligence 195, 2013
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 found in polynomial time while verifying whether a given partition is Pa
Externí odkaz:
http://arxiv.org/abs/1005.4540
Publikováno v:
Economic Theory, 2018 Mar 01. 65(2), 483-507.
Externí odkaz:
https://www.jstor.org/stable/26705031
Publikováno v:
In Mathematical Social Sciences May 2017 87:55-63