Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hans Georg Seedig

dblp:58/8147 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Theory of computation · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Algorithmic game theory and mechanism design · 82% Computational complexity · 18%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › coalition formation › hedonic games
additively separable hedonic games
0.322013
Computing desirable partitions in additively separable hedonic games · Artif. Intell. 2013
Optimal Partitions in Additively Separable Hedonic Games · IJCAI 2011
Algorithmic game theory and mechanism design › coalition formation
hedonic games
0.322013
Computing desirable partitions in additively separable hedonic games · Artif. Intell. 2013
Optimal Partitions in Additively Separable Hedonic Games · IJCAI 2011
Algorithmic game theory and mechanism design
coalition formation
0.212013
Computing desirable partitions in additively separable hedonic games · Artif. Intell. 2013
Algorithmic game theory and mechanism design
fair division
0.212013
Computing desirable partitions in additively separable hedonic games · Artif. Intell. 2013
Computational complexity › parameterized complexity
fixed-parameter tractability
0.112011
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions · IJCAI 2011
Computational complexity
parameterized complexity
0.112011
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions · IJCAI 2011
Algorithmic game theory and mechanism design
social choice
0.112011
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions · IJCAI 2011
Algorithmic game theory and mechanism design › social choice
tournament solutions
0.112011
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions · IJCAI 2011

Methods — techniques the papers use, named apart from their topics

parameterized complexity analysis · 0.1
YearPublicationVenuePosition
2019 k-Majority digraphs and the hardness of voting with a constant number of voters
Georg Bachmeier, Felix Brandt 0001, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig
J. Comput. Syst. Sci.7
2015 Bounds on the disparity and separation of tournament solutions
Felix Brandt 0001, Andre Dau, Hans Georg Seedig
Discret. Appl. Math.3
2015 Possible and Necessary Winners of Partial Tournaments
abstract
We study the problem of computing possible and necessary winners for partially specified weighted and unweighted tournaments. This problem arises naturally in elections with incompletely specified votes, partially completed sports competitions, and more generally in any scenario where the outcome of some pairwise comparisons is not yet fully known. We specifically consider a number of well-known solution concepts---including the uncovered set, Borda, ranked pairs, and maximin---and show that for most of them, possible and necessary winners can be identified in polynomial time. These positive algorithmic results stand in sharp contrast to earlier results concerning possible and necessary winners given partially specified preference profiles.
Haris Aziz 0001, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jérôme Lang, Hans Georg Seedig
J. Artif. Intell. Res.6
2013 Computing desirable partitions in additively separable hedonic games
Haris Aziz 0001, Felix Brandt 0001, Hans Georg Seedig
Artif. Intell.3
2011 Optimal Partitions in Additively Separable Hedonic Games
Haris Aziz 0001, Felix Brandt 0001, Hans Georg Seedig
IJCAI3
2011 On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions
Felix Brandt 0001, Markus Brill, Hans Georg Seedig
IJCAI3
2009 Forecasting of clustered time series with recurrent neural networks and a fuzzy clustering scheme
abstract
Fuzzy c-neural network models (FCNNM) combine clustering techniques with advanced neural networks for time series modeling in order to make predictions for a possibly large set of time series using only a small number of models. Given a set of time series, FCNNM finds a partition matrix that quantifies to which degree each time series is associated with each prediction model, as well as the parameters of the neural network models for each cluster. FCNNM allows to automatically identify groups of time series with similar dynamics. This results in higher data efficiency, being of particular interest in cases of poor data availability. We illustrate the application of FCNNM to cash withdrawal series as part of an effective cash management.
Hans Georg Seedig, Ralph Grothmann, Thomas A. Runkler
IJCNN1
2008 Fuzzy c-auto regression models
abstract
Fuzzy c-auto regression models (FCARM) combine clustering with time series prediction. Given a set of time series, FCARM finds clusters of time series with similar dynamics. More specifically, FCARM finds a partition matrix that quantifies to which degree each time series is associated with each prediction model, and the parameters of the (linear) auto regression models for each cluster. FCARM can thus be used for two different purposes: (i) the automatic identification of clusters of time series with similar dynamics and (ii) the forecast of a large number of time series using only a small number of generic forecast models, leading to higher data efficiency and lower model validation and maintenance effort. We illustrate the application of FCARM to sales forecasts for products that can be clustered into groups with similar sales dynamics.
Thomas A. Runkler, Hans Georg Seedig
FUZZ-IEEE2