The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Felix A. Fischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Felix Brandt, Felix A. Fischer, Yoav Shoham
    On Strictly Competitive Multi-Player Games. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. Felix A. Fischer, Matthias Nickles
    Computational Opinions. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:240-244 [Conf]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. Felix Brandt, Felix A. Fischer
    Computational Aspects of Covering in Dominance Graphs. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:694-699 [Conf]

  15. A Computational Analysis of the Tournament Equilibrium Set. [Citation Graph (, )][DBLP]


  16. Adaptiveness in Agent Communication: Application and Adaptation of Conversation Patterns. [Citation Graph (, )][DBLP]


  17. Commitment and extortion. [Citation Graph (, )][DBLP]


  18. Computational aspects of Shapley's saddles. [Citation Graph (, )][DBLP]


  19. Minimal retentive sets in tournaments. [Citation Graph (, )][DBLP]


  20. The Complexity of Computing Minimal Unidirectional Covering Sets. [Citation Graph (, )][DBLP]


  21. Incentive Compatible Regression Learning. [Citation Graph (, )][DBLP]


  22. Mix and match. [Citation Graph (, )][DBLP]


  23. A new perspective on implementation by voting trees. [Citation Graph (, )][DBLP]


  24. Incentive compatible regression learning. [Citation Graph (, )][DBLP]


  25. On Iterated Dominance, Matrix Elimination, and Matched Paths. [Citation Graph (, )][DBLP]


  26. The computational complexity of choice sets. [Citation Graph (, )][DBLP]


  27. Equilibria of Graphical Games with Symmetries. [Citation Graph (, )][DBLP]


  28. PageRank as a Weak Tournament Solution. [Citation Graph (, )][DBLP]


  29. On the Hardness and Existence of Quasi-Strict Equilibria. [Citation Graph (, )][DBLP]


  30. On the Complexity of Iterated Weak Dominance in Constant-Sum Games. [Citation Graph (, )][DBLP]


  31. The Computational Complexity of Weak Saddles. [Citation Graph (, )][DBLP]


  32. Ranking games. [Citation Graph (, )][DBLP]


  33. Recognizing Members of the Tournament Equilibrium Set is NP-hard [Citation Graph (, )][DBLP]


  34. Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP [Citation Graph (, )][DBLP]


  35. Sum of Us: Strategyproof Selection from the Selectors [Citation Graph (, )][DBLP]


  36. On Iterated Dominance, Matrix Elimination, and Matched Paths [Citation Graph (, )][DBLP]


  37. Mix and Match [Citation Graph (, )][DBLP]


  38. On Iterated Dominance, Matrix Elimination, and Matched Paths. [Citation Graph (, )][DBLP]


  39. Equilibria of Graphical Games with Symmetries. [Citation Graph (, )][DBLP]


  40. Symmetries and the Complexity of Pure Nash Equilibrium. [Citation Graph (, )][DBLP]


Search in 0.235secs, Finished in 0.237secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002