default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelix A. Fischer
- > Home > Persons > Felix A. Fischer
Publications
- 2015
[j21]Haris Aziz
, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jérôme Lang, Hans Georg Seedig:
Possible and Necessary Winners of Partial Tournaments. J. Artif. Intell. Res. 54: 493-534 (2015)- 2014
- [j18]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. Soc. Choice Welf. 42(3): 551-574 (2014) - 2013
- [j17]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
On the Rate of Convergence of Fictitious Play. Theory Comput. Syst. 53(1): 41-52 (2013) - 2012
- [c34]Haris Aziz, Paul Harrenstein, Markus Brill, Jérôme Lang, Felix A. Fischer, Hans Georg Seedig:
Possible and necessary winners of partial tournaments. AAMAS 2012: 585-592 - 2011
- [j14]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Theory Comput. Syst. 49(1): 162-181 (2011) - 2010
- [j10]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair:
A computational analysis of the tournament equilibrium set. Soc. Choice Welf. 34(4): 597-609 (2010) - [c30]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Minimal retentive sets in tournaments. AAMAS 2010: 47-58 - [c28]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
On the Rate of Convergence of Fictitious Play. SAGT 2010: 102-113 - 2009
- [j9]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham:
Ranking games. Artif. Intell. 173(2): 221-239 (2009) - [j7]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
The Computational Complexity of Choice Sets. Math. Log. Q. 55(4): 444-459 (2009) - [j6]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann:
Computing Shapley's saddles. SIGecom Exch. 8(2): 3 (2009) - [c25]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
Computational aspects of Shapley's saddles. AAMAS (1) 2009: 209-216 - [c23]Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
On the Complexity of Iterated Weak Dominance in Constant-Sum Games. SAGT 2009: 287-298 - 2008
- [c21]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair:
A Computational Analysis of the Tournament Equilibrium Set. AAAI 2008: 38-43 - 2007
- [c16]Paul Harrenstein, Felix Brandt, Felix A. Fischer:
Commitment and extortion. AAMAS 2007: 26 - [c15]Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham:
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. IJCAI 2007: 1199-1206 - [c13]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
The computational complexity of choice sets. TARK 2007: 82-91 - [i3]Felix Brandt, Felix A. Fischer, Paul Harrenstein:
Recognizing Members of the Tournament Equilibrium Set is NP-hard. CoRR abs/0711.2961 (2007)
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-08-05 20:23 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:
