Follow
Hans Georg Seedig
Hans Georg Seedig
Verified email at in.tum.de
Title
Cited by
Cited by
Year
Computing desirable partitions in additively separable hedonic games
H Aziz, F Brandt, HG Seedig
Artificial Intelligence 195, 316-334, 2013
187*2013
Consistent probabilistic social choice
F Brandl, F Brandt, HG Seedig
Econometrica 84 (5), 1839-1880, 2016
1022016
Possible and necessary winners of partial tournaments
H Aziz, M Brill, F Fischer, P Harrenstein, J Lang, HG Seedig
Journal of Artificial Intelligence Research 54, 493-534, 2015
562015
On the discriminative power of tournament solutions
F Brandt, HG Seedig
Operations Research Proceedings 2014: Selected Papers of the Annual …, 2016
302016
On the fixed-parameter tractability of composition-consistent tournament solutions
F Brandt, M Brill, HG Seedig
on Computational Social Choice (COMSOC-2010), 43, 2010
292010
On the structure of stable tournament solutions
F Brandt, M Brill, HG Seedig, W Suksompong
Economic Theory 65, 483-507, 2018
262018
Optimal partitions in additively separable hedonic games
H Aziz, F Brandt, HG Seedig
arXiv preprint arXiv:1005.4540, 2010
232010
On the susceptibility of the deferred acceptance algorithm
H Aziz, HG Seedig, JK Von Wedel
arXiv preprint arXiv:1502.06318, 2015
202015
Bounds on the disparity and separation of tournament solutions
F Brandt, A Dau, HG Seedig
Discrete Applied Mathematics 187, 41-49, 2015
182015
k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters
G Bachmeier, F Brandt, C Geist, P Harrenstein, K Kardel, D Peters, ...
Journal of Computer and System Sciences 105, 130-157, 2019
172019
Minimal extending sets in tournaments
F Brandt, P Harrenstein, HG Seedig
Mathematical Social Sciences 87, 55-63, 2017
162017
Network flow optimization with minimum quantities
HG Seedig
Operations Research Proceedings 2010: Selected Papers of the Annual …, 2011
152011
It only takes a few: on the hardness of voting with a constant number of agents.
F Brandt, P Harrenstein, K Kardel, HG Seedig
AAMAS, 375-382, 2013
122013
A tournament of order 24 with two disjoint TEQ-retentive sets
F Brandt, HG Seedig
arXiv preprint arXiv:1302.5592, 2013
122013
Forecasting of clustered time series with recurrent neural networks and a fuzzy clustering scheme
HG Seedig, R Grothmann, TA Runkler
2009 International Joint Conference on Neural Networks, 2846-2853, 2009
122009
Identifying k-majority digraphs via SAT solving
F Brandt, C Geist, HG Seedig
Proceedings of the 1st AAMAS workshop on exploring beyond the worst case in …, 2014
82014
Fuzzy c-auto regression models
TA Runkler, HG Seedig
2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on …, 2008
52008
Majority Relations and Tournament Solutions: A Computational Study
HG Seedig
Technische Universität München, 2015
32015
Majority Relations and Tournament Solutions
HG Seedig
Universität München, 2015
12015
Possible and necessary winners of partial tournaments
B Harrenstein, M Brill, J Lang, H Aziz, F Fischer, H Seedig
Journal of Artificial Intelligence Research, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20