Thursday 5th of May 2016
seedig  

Dr. Hans Georg Seedig

E-Mail:   seedighzzin.tum.de

Short Bio

Hans Georg studied Mathematics and Computer Science, both at Technische Universität München. He received his bachelor's degree in Computer Science in 2008 and his diploma in Mathematics in 2009. Hans Georg joined the group of Felix Brandt in November 2009 and submitted his doctoral thesis in September 2014.

In early 2015, he has left TUM and academia for greener pastures. 

Thesis

H. G. Seedig. Majority relations and tournament solutions: A computational study. PhD thesis, Technische Universität München, 2015. [ pdf ]

Publications

F. Brandl, F. Brandt, and H. G. Seedig. Consistent probabilistic social choice. Econometrica, 2016. Forthcoming. [ pdf ]

F. Brandt and H. G. Seedig. On the discriminative power of tournament solutions. In Selected papers of the International Conference on Operations Research, OR2014, Operations Research Proceedings, pages 53-58. Springer-Verlag, 2016. [ link | pdf | venue ]

F. Brandt, P. Harrenstein, and H. G. Seedig. Minimal extending sets in tournaments. Mathematical Social Sciences, 2016. Forthcoming. [ pdf ]

F. Brandt, A. Dau, and H. G. Seedig. Bounds on the disparity and separation of tournament solutions. Discrete Applied Mathematics, 187:41-49, 2015. [ link | pdf ]

F. Brandt, P. Harrenstein, and H. G. Seedig. Minimal extending sets in tournaments. In Proceedings of the 13th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 1539-1540. IFAAMAS, 2014. [ link | pdf | venue ]

F. Brandt, C. Geist, and H. G. Seedig. Identifying k-majority digraphs via SAT solving. In Proceedings of the 1st AAMAS Workshop on Exploring Beyond the Worst Case in Computational Social Choice (EXPLORE), 2014. [ link | pdf | venue ]

H. Aziz, F. Brandt, and H. G. Seedig. Computing desirable partitions in additively separable hedonic games. Artificial Intelligence, 195:316-334, 2013. [ link | pdf ]

F. Brandt, P. Harrenstein, K. Kardel, and H. G. Seedig. It only takes a few: On the hardness of voting with a constant number of agents. In Proceedings of the 12th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 375-382. IFAAMAS, 2013. [ link | pdf | venue ]

F. Brandt and H. G. Seedig. A tournament of order 24 with two disjoint TEQ-retentive sets. Technical report, http://arxiv.org/abs/1302.5592, 2013. [ link | pdf ]

H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, and H. G. Seedig. Possible and necessary winners of partial tournaments. In Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 585-592. IFAAMAS, 2012. [ link | pdf | venue ]

H. Aziz, F. Brandt, and H. G. Seedig. Optimal partitions in additively separable hedonic games. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pages 43-48. AAAI Press, 2011. [ link | pdf | venue ]

H. Aziz, F. Brandt, and H. G. Seedig. Stable partitions in additively separable hedonic games. In Proceedings of the 10th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 183-190. IFAAMAS, 2011. [ link | pdf | venue ]

F. Brandt, M. Brill, and H. G. Seedig. On the fixed-parameter tractability of composition-consistent tournament solutions. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pages 85-90. AAAI Press, 2011. [ link | pdf | venue ]

H. G. Seedig. Network flow optimization with minimum quantities. In B. Hu, K. Morasch, S. Pickl, and M. Siegle, editors, Operations Research Proceedings 2010, pages 295-300. Springer, 2010. [ pdf ]

H. G. Seedig, R. Grothmann, and T. Runkler. Forecasting of clustered time series with recurrent neural networks and a fuzzy clustering scheme. In Proceedings of the 2009 International Joint Conference on Neural Networks, pages 1360-1367, 2009.

T. Runkler and H. G. Seedig. Fuzzy c-auto regression models. In Proceedings of the IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pages 1818-1825, 2008.

Teaching

Courses

Student projects

  • IDP Transitive Subtournaments and set-theoretic relationships between tournament solutions (André Dau, 2011)
  • IDP It only takes a few: On the hardness of voting with a constant number of agents (Keyvan Kardel, 2012/2013)
  • IDP Payment Optimization (Kilian Röhner, 2013)
  • IDP Majority Relations for a constant number of voters (Georg Bachmeier, 2013/2014)
  • Master's thesis On Deferred Acceptance Algorithms (Jana von Wedel, 2013/2014)

Community Service

Refereeing Journals

  • Annals of Operations Research
  • Autonomous Agents and Multi-Agent Systems
  • Information Processing Letters
  • Mathematical Social Sciences
  • Operations Research
  • Social Choice and Welfare

Refereeing Conferences

  • EC 2010, 2012
  • AAAI 2010, 2012, 2014
  • COMSOC 2010, 2012, 2014
  • STACS 2011, 2012
  • AAMAS 2011, 2013, 2014
  • IJCAI 2011, 2013
  • VoteID 2011
  • SAGT 2013
Decision Sciences & Systems (DSS), Department of Informatics (I18), Technische Universität München, Boltzmannstr. 3, 85748 Garching, Germany
©2002-2016 DSS All Rights Reserved
Impressum, Privacy Policy, Copyright Information and Disclaimer