The SCEAS System
| |||||||

## Search the dblp DataBase
Felix A. Fischer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Felix Brandt, Felix A. Fischer, Yoav Shoham
**On Strictly Competitive Multi-Player Games.**[Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf] - Gerhard Weiß, Felix A. Fischer, Matthias Nickles, Michael Rovatsos
**Operational Modelling of Agent Autonomy: Theoretical Aspects and a Formal Language.**[Citation Graph (0, 0)][DBLP] AOSE, 2005, pp:1-15 [Conf] - Michael Rovatsos, Iyad Rahwan, Felix A. Fischer, Gerhard Weiß
**Practical Strategic Reasoning and Adaptation in Rational Argument-Based Negotiation.**[Citation Graph (0, 0)][DBLP] ArgMAS, 2005, pp:122-137 [Conf] - Felix A. Fischer, Michael Rovatsos, Gerhard Weiß
**Hierarchical Reinforcement Learning in Communication-Mediated Multiagent Coordination.**[Citation Graph (0, 0)][DBLP] AAMAS, 2004, pp:1334-1335 [Conf] - Felix A. Fischer, Michael Rovatsos, Gerhard Weiß
**Acquiring and adapting probabilistic models of agent conversation.**[Citation Graph (0, 0)][DBLP] AAMAS, 2005, pp:106-113 [Conf] - Michael Rovatsos, Felix A. Fischer, Gerhard Weiß
**An integrated framework for adaptive reasoning about conversation patterns.**[Citation Graph (0, 0)][DBLP] AAMAS, 2005, pp:1123-1124 [Conf] - Felix A. Fischer, Michael Rovatsos
**Reasoning About Communication - A Practical Approach Based on Empirical Semantics.**[Citation Graph (0, 0)][DBLP] CIA, 2004, pp:107-122 [Conf] - Felix A. Fischer, Matthias Nickles
**Computational Opinions.**[Citation Graph (0, 0)][DBLP] ECAI, 2006, pp:240-244 [Conf] - Matthias Nickles, Felix A. Fischer
**Communication Attitudes: A Formal Account of Ostensible Beliefs and Intentions.**[Citation Graph (0, 0)][DBLP] EUMAS, 2005, pp:493-494 [Conf] - Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham
**A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios.**[Citation Graph (0, 0)][DBLP] IJCAI, 2007, pp:1199-1206 [Conf] - Felix Brandt, Felix A. Fischer, Markus Holzer
**Symmetries and the Complexity of Pure Nash Equilibrium.**[Citation Graph (0, 0)][DBLP] STACS, 2007, pp:212-223 [Conf] - Matthias Nickles, Felix A. Fischer, Gerhard Weiß
**Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:157, n:4, pp:95-115 [Journal] - Felix A. Fischer, Markus Holzer, Stefan Katzenbeisser
**The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:99, n:6, pp:239-245 [Journal] - Felix Brandt, Felix A. Fischer
**Computational Aspects of Covering in Dominance Graphs.**[Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:694-699 [Conf] **A Computational Analysis of the Tournament Equilibrium Set.**[Citation Graph (, )][DBLP]**Adaptiveness in Agent Communication: Application and Adaptation of Conversation Patterns.**[Citation Graph (, )][DBLP]**Commitment and extortion.**[Citation Graph (, )][DBLP]**Computational aspects of Shapley's saddles.**[Citation Graph (, )][DBLP]**Minimal retentive sets in tournaments.**[Citation Graph (, )][DBLP]**The Complexity of Computing Minimal Unidirectional Covering Sets.**[Citation Graph (, )][DBLP]**Incentive Compatible Regression Learning.**[Citation Graph (, )][DBLP]**Mix and match.**[Citation Graph (, )][DBLP]**A new perspective on implementation by voting trees.**[Citation Graph (, )][DBLP]**Incentive compatible regression learning.**[Citation Graph (, )][DBLP]**On Iterated Dominance, Matrix Elimination, and Matched Paths.**[Citation Graph (, )][DBLP]**The computational complexity of choice sets.**[Citation Graph (, )][DBLP]**Equilibria of Graphical Games with Symmetries.**[Citation Graph (, )][DBLP]**PageRank as a Weak Tournament Solution.**[Citation Graph (, )][DBLP]**On the Hardness and Existence of Quasi-Strict Equilibria.**[Citation Graph (, )][DBLP]**On the Complexity of Iterated Weak Dominance in Constant-Sum Games.**[Citation Graph (, )][DBLP]**The Computational Complexity of Weak Saddles.**[Citation Graph (, )][DBLP]**Ranking games.**[Citation Graph (, )][DBLP]**Recognizing Members of the Tournament Equilibrium Set is NP-hard**[Citation Graph (, )][DBLP]**Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP**[Citation Graph (, )][DBLP]**Sum of Us: Strategyproof Selection from the Selectors**[Citation Graph (, )][DBLP]**On Iterated Dominance, Matrix Elimination, and Matched Paths**[Citation Graph (, )][DBLP]**Mix and Match**[Citation Graph (, )][DBLP]**On Iterated Dominance, Matrix Elimination, and Matched Paths.**[Citation Graph (, )][DBLP]**Equilibria of Graphical Games with Symmetries.**[Citation Graph (, )][DBLP]**Symmetries and the Complexity of Pure Nash Equilibrium.**[Citation Graph (, )][DBLP]
Search in 0.235secs, Finished in 0.237secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |