default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Geist
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]Christian Geist:
Generating Insights in Social Choice Theory via Computer-aided Methods. Technical University Munich, Germany, 2016
Journal Articles
- 2019
- [j7]Florian Brandl, Felix Brandt, Christian Geist, Johannes Hofbauer:
Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. J. Artif. Intell. Res. 66: 1031-1056 (2019) - [j6]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) - 2018
- [j5]Florian Brandl, Felix Brandt, Manuel Eberl, Christian Geist:
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. J. ACM 65(2): 6:1-6:28 (2018) - 2017
- [j4]Felix Brandt, Christian Geist, Dominik Peters:
Optimal bounds for the no-show paradox via SAT solving. Math. Soc. Sci. 90: 18-27 (2017) - 2016
- [j3]Felix Brandt, Christian Geist:
Finding Strategyproof Social Choice Functions via SAT Solving. J. Artif. Intell. Res. 55: 565-602 (2016) - [j2]Felix Brandt, Christian Geist, Paul Harrenstein:
A note on the McKelvey uncovered set and Pareto optimality. Soc. Choice Welf. 46(1): 81-91 (2016) - 2011
- [j1]Christian Geist, Ulrich Endriss:
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects. J. Artif. Intell. Res. 40: 143-174 (2011)
Conference and Workshop Papers
- 2016
- [c6]Felix Brandt, Christian Geist, Dominik Peters:
Optimal Bounds for the No-Show Paradox via SAT Solving. AAMAS 2016: 314-322 - [c5]Felix Brandt, Christian Geist, Martin Strobel:
Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data. AAMAS 2016: 385-393 - [c4]Florian Brandl, Felix Brandt, Christian Geist:
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. IJCAI 2016: 116-122 - 2015
- [c3]Felix Brandt, Guillaume Chabin, Christian Geist:
Pnyx: : A Powerful and User-friendly Tool for Preference Aggregation. AAMAS 2015: 1915-1916 - [c2]Florian Brandl, Felix Brandt, Christian Geist, Johannes Hofbauer:
Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. IJCAI 2015: 18-24 - 2014
- [c1]Felix Brandt, Christian Geist:
Finding strategyproof social choice functions via SAT solving. AAMAS 2014: 1193-1200
Informal and Other Publications
- 2017
- [i5]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) - 2016
- [i4]Felix Brandt, Christian Geist, Dominik Peters:
Optimal Bounds for the No-Show Paradox via SAT Solving. CoRR abs/1602.08063 (2016) - [i3]Florian Brandl, Felix Brandt, Christian Geist:
Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. CoRR abs/1604.05692 (2016) - 2014
- [i2]Christian Geist, Ulle Endriss:
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects. CoRR abs/1401.3866 (2014) - [i1]Christian Geist:
Finding Preference Profiles of Condorcet Dimension $k$ via SAT. CoRR abs/1402.4303 (2014)
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-24 23:04 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:
