default search action
Hans Georg Seedig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [i7]Felix Brandt, Markus Brill, Hans Georg Seedig, Warut Suksompong:
On the Structure of Stable Tournament Solutions. CoRR abs/2004.01651 (2020)
2010 – 2019
- 2019
- [j5]Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters
, Hans Georg Seedig:
k-Majority digraphs and the hardness of voting with a constant number of voters. J. Comput. Syst. Sci. 105: 130-157 (2019) - 2017
- [j4]Felix Brandt, Paul Harrenstein, Hans Georg Seedig:
Minimal extending sets in tournaments. Math. Soc. Sci. 87: 55-63 (2017) - [i6]Georg Bachmeier, Felix Brandt, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig:
k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. CoRR abs/1704.06304 (2017) - 2015
- [b1]Hans Georg Seedig:
Majority Relations and Tournament Solutions (Mehrheitsrelationen und Turnierlösungen). Technical University of Munich, Germany, 2015 - [j3]Felix Brandt, Andre Dau, Hans Georg Seedig:
Bounds on the disparity and separation of tournament solutions. Discret. Appl. Math. 187: 41-49 (2015) - [j2]Haris Aziz
Possible and Necessary Winners of Partial Tournaments. J. Artif. Intell. Res. 54: 493-534 (2015) - [c11]Haris Aziz
On the Susceptibility of the Deferred Acceptance Algorithm. AAMAS 2015: 939-947 - [i5]Haris Aziz, Hans Georg Seedig, Jana Karina von Wedel:
On the Susceptibility of the Deferred Acceptance Algorithm. CoRR abs/1502.06318 (2015) - [i4]Florian Brandl, Felix Brandt, Hans Georg Seedig:
Consistent Probabilistic Social Choice. CoRR abs/1503.00694 (2015) - 2014
- [c10]Felix Brandt, Paul Harrenstein, Hans Georg Seedig:
Minimal extending sets in tournaments. AAMAS 2014: 1539-1540 - [c9]Felix Brandt, Hans Georg Seedig:
On the Discriminative Power of Tournament Solutions. OR 2014: 53-58 - 2013
- [j1]Haris Aziz
Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195: 316-334 (2013) - [c8]Felix Brandt, Paul Harrenstein, Keyvan Kardel, Hans Georg Seedig:
It only takes a few: on the hardness of voting with a constant number of agents. AAMAS 2013: 375-382 - [i3]Felix Brandt, Hans Georg Seedig:
A tournament of order 24 with two disjoint TEQ-retentive sets. CoRR abs/1302.5592 (2013) - 2012
- [c7]Haris Aziz
Possible and necessary winners of partial tournaments. AAMAS 2012: 585-592 - 2011
- [c6]Haris Aziz, Felix Brandt, Hans Georg Seedig:
Stable partitions in additively separable hedonic games. AAMAS 2011: 183-190 - [c5]Haris Aziz
Optimal Partitions in Additively Separable Hedonic Games. IJCAI 2011: 43-48 - [c4]Felix Brandt, Markus Brill, Hans Georg Seedig:
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. IJCAI 2011: 85-90 - 2010
- [c3]Hans Georg Seedig:
Network Flow Optimization with Minimum Quantities. OR 2010: 295-300 - [i2]Haris Aziz, Felix Brandt, Hans Georg Seedig:
Optimal Partitions in Additively Separable Hedonic Games. CoRR abs/1005.4540 (2010) - [i1]Haris Aziz, Felix Brandt, Hans Georg Seedig:
Stable partitions in additively separable hedonic games. CoRR abs/1008.0074 (2010)
2000 – 2009
- 2009
- [c2]Hans Georg Seedig, Ralph Grothmann, Thomas A. Runkler
Forecasting of clustered time series with recurrent neural networks and a fuzzy clustering scheme. IJCNN 2009: 2846-2853 - 2008
- [c1]Thomas A. Runkler
Fuzzy c-auto regression models. FUZZ-IEEE 2008: 1818-1825
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: