| Publication | Date of Publication | Type |
|---|
| Incentives in social decision schemes with pairwise comparison preferences | 2024-01-11 | Paper |
| Strong well-posedness and dynamics of a nematic liquid crystal-colloidal interaction model | 2023-10-26 | Paper |
| Nonlinear theory remedies the lack of invertibility in time periodic fluid flows | 2023-10-24 | Paper |
| Characterizing the top cycle via strategyproofness | 2023-10-17 | Paper |
| Strong periodic solutions to quasilinear parabolic equations: An approach by the Da Prato–Grisvard theorem | 2023-09-15 | Paper |
| Time periodic solutions to Hibler’s sea ice model | 2023-05-31 | Paper |
| Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox | 2022-12-06 | Paper |
| Exploring the No-Show Paradox for Condorcet Extensions | 2022-12-06 | Paper |
| Rigorous analysis of the interaction problem of sea ice with a rigid body | 2022-09-28 | Paper |
| Well-posedness of a coupled atmosphere-sea ice-ocean model | 2022-09-27 | Paper |
| Finding and Recognizing Popular Coalition Structures | 2022-08-02 | Paper |
| Strategyproof social choice when preferences and outcomes may contain ties | 2022-06-09 | Paper |
| Rigorous analysis and dynamics of Hibler's sea ice model | 2022-06-01 | Paper |
| On the Indecisiveness of Kelly-Strategyproof Social Choice Functions | 2022-05-16 | Paper |
| Funding public projects: a case for the Nash product rule | 2022-03-09 | Paper |
| An analytical and experimental comparison of maximal lottery schemes | 2022-03-04 | Paper |
| Computational social choice: the first ten years and beyond | 2022-02-16 | Paper |
| Arrovian Aggregation of Convex Preferences | 2021-06-07 | Paper |
| Introduction to Computational Social Choice | 2020-11-12 | Paper |
| Tournament Solutions | 2020-11-12 | Paper |
| Justifying optimal play via consistency | 2020-09-14 | Paper |
| On the convergence of swap dynamics to Pareto-optimal matchings | 2020-06-30 | Paper |
| Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities | 2020-01-03 | Paper |
| \(k\)-majority digraphs and the hardness of voting with a constant number of voters | 2019-08-07 | Paper |
| Welfare maximization entices participation | 2019-03-29 | Paper |
| Consistent Probabilistic Social Choice | 2019-01-31 | Paper |
| The air cargo load planning problem -- a consolidated problem definition and literature review on related problems | 2019-01-28 | Paper |
| Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving | 2018-12-06 | Paper |
| Extending tournament solutions | 2018-11-07 | Paper |
| Corrigendum to ``The impossibility of extending random dictatorship to weak preferences | 2018-09-05 | Paper |
| The impossibility of extending random dictatorship to weak preferences | 2018-09-03 | Paper |
| On the tradeoff between efficiency and strategyproofness | 2018-07-12 | Paper |
| On the structure of stable tournament solutions | 2018-03-29 | Paper |
| Optimal bounds for the no-show paradox via SAT solving | 2017-11-22 | Paper |
| Minimal extending sets in tournaments | 2017-10-04 | Paper |
| Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012 | 2016-11-07 | Paper |
| On the Discriminative Power of Tournament Solutions | 2016-05-19 | Paper |
| Finding Strategyproof Social Choice Functions via SAT Solving | 2016-03-11 | Paper |
| A note on the McKelvey uncovered set and Pareto optimality | 2016-03-01 | Paper |
| An ordinal minimax theorem | 2016-03-01 | Paper |
| Set-monotonicity implies Kelly-strategyproofness | 2016-01-14 | Paper |
| Universal Pareto dominance and welfare for plausible utility functions | 2015-10-12 | Paper |
| Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates | 2015-08-25 | Paper |
| Bounds on the disparity and separation of tournament solutions | 2015-06-10 | Paper |
| The computational complexity of random serial dictatorship | 2015-01-12 | Paper |
| Minimal retentive sets in tournaments | 2014-12-15 | Paper |
| The computational complexity of random serial dictatorship | 2014-06-06 | Paper |
| A counterexample to a conjecture of Schwartz | 2014-05-30 | Paper |
| Pareto optimality in coalition formation | 2014-03-13 | Paper |
| A constraint programming-based approach to a large-scale energy management problem with varied constraints | 2014-02-05 | Paper |
| On Popular Random Assignments | 2013-10-23 | Paper |
| The complexity of computing minimal unidirectional covering sets | 2013-10-21 | Paper |
| On the rate of convergence of fictitious play | 2013-10-21 | Paper |
| Computing desirable partitions in additively separable hedonic games | 2013-08-26 | Paper |
| A tournament of order 24 with two disjoint TEQ-retentive sets | 2013-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113741 | 2012-01-23 | Paper |
| On the complexity of iterated weak dominance in constant-sum games | 2011-11-23 | Paper |
| The computational complexity of weak saddles | 2011-11-23 | Paper |
| Pareto Optimality in Coalition Formation | 2011-10-28 | Paper |
| Minimal stable sets in tournaments | 2011-08-16 | Paper |
| Set-rationalizable choice and self-stability | 2011-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001124 | 2011-05-31 | Paper |
| Equilibria of graphical games with symmetries | 2011-02-21 | Paper |
| On the Rate of Convergence of Fictitious Play | 2010-10-19 | Paper |
| Characterization of dominance relations in finite coalitional games | 2010-09-20 | Paper |
| The complexity of computing minimal unidirectional covering sets | 2010-05-28 | Paper |
| A computational analysis of the tournament equilibrium set | 2010-04-21 | Paper |
| Computer Aided Verification | 2010-03-31 | Paper |
| The Computational Complexity of Weak Saddles | 2009-12-01 | Paper |
| On the Complexity of Iterated Weak Dominance in Constant-Sum Games | 2009-12-01 | Paper |
| Ranking games | 2009-08-31 | Paper |
| The Computational Complexity of Choice Sets | 2009-08-14 | Paper |
| Some Remarks on Dodgson's Voting Rule | 2009-08-14 | Paper |
| Symmetries and the complexity of pure Nash equilibrium | 2009-03-02 | Paper |
| Computing the minimal covering set | 2008-09-10 | Paper |
| On the Hardness and Existence of Quasi-Strict Equilibria | 2008-05-02 | Paper |
| Symmetries and the Complexity of Pure Nash Equilibrium | 2007-09-03 | Paper |
| Information Security and Cryptology - ICISC 2005 | 2007-05-02 | Paper |
| How to obtain full privacy in auctions | 2006-10-13 | Paper |
| Financial Cryptography and Data Security | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739308 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436003 | 2003-11-23 | Paper |
