The SCEAS System
Navigation Menu

Search the dblp DataBase


Felix Brandt: [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. Felix Brandt, Gerhard Weiß
    Vicious strategies for Vickrey auctions. [Citation Graph (0, 0)][DBLP]
    Agents, 2001, pp:71-72 [Conf]
  3. Felix Brandt, Tuomas Sandholm
    Im)Possibility of Unconditionally Privacy-Preserving Auctions. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:810-817 [Conf]
  4. Felix Brandt, Tuomas Sandholm
    Decentralized voting with unconditional privacy. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2005, pp:357-364 [Conf]
  5. Felix Brandt, Gerhard Weiß
    Antisocial Agents and Vickrey Auctions. [Citation Graph (0, 0)][DBLP]
    ATAL, 2001, pp:335-347 [Conf]
  6. Felix Brandt
    Cryptographic Protocols for Secure Second-Price Auctions. [Citation Graph (0, 0)][DBLP]
    CIA, 2001, pp:154-165 [Conf]
  7. Felix Brandt, Wilfried Brauer, Gerhard Weiß
    Task Assignment in Multiagent Systems Based on Vickrey-Type Auctioning and Leveled Commitment Contracting. [Citation Graph (0, 0)][DBLP]
    CIA, 2000, pp:95-106 [Conf]
  8. Felix Brandt, Tuomas Sandholm, Yoav Shoham
    Spiteful Bidding in Sealed-Bid Auctions. [Citation Graph (0, 0)][DBLP]
    Computing and Markets, 2005, pp:- [Conf]
  9. Felix Brandt
    Fully Private Auctions in a Constant Number of Rounds. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2003, pp:223-238 [Conf]
  10. Felix Brandt, Tuomas Sandholm
    Efficient Privacy-Preserving Protocols for Multi-unit Auctions. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2005, pp:298-312 [Conf]
  11. Stephan Schulz, Felix Brandt
    Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 1999, pp:244-248 [Conf]
  12. Felix Brandt
    Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption. [Citation Graph (0, 0)][DBLP]
    ICISC, 2005, pp:32-47 [Conf]
  13. 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]
  14. Felix Brandt, Tuomas Sandholm, Yoav Shoham
    Spiteful Bidding in Sealed-Bid Auctions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1207-1214 [Conf]
  15. Felix Brandt
    Social choice and preference protection: towards fully private mechanism design. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:220-221 [Conf]
  16. 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]
  17. Felix Brandt, Tuomas Sandholm
    Unconditional privacy in social choice. [Citation Graph (0, 0)][DBLP]
    TARK, 2005, pp:207-218 [Conf]
  18. Felix Brandt
    How to obtain full privacy in auctions. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2006, v:5, n:4, pp:201-216 [Journal]
  19. Felix Brandt, Felix A. Fischer
    Computational Aspects of Covering in Dominance Graphs. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:694-699 [Conf]

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

  21. Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. [Citation Graph (, )][DBLP]

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

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

  24. Monotone cooperative games and their threshold versions. [Citation Graph (, )][DBLP]

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

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

  27. Tournament Solutions and Their Applications to Multiagent Decision Making. [Citation Graph (, )][DBLP]

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

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

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

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

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

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

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

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

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

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

  38. Set-Rationalizable Choice and Self-Stability [Citation Graph (, )][DBLP]

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

  40. Optimal Partitions in Additively Separable Hedonic Games [Citation Graph (, )][DBLP]

  41. Group-Strategyproof Irresolute Social Choice Functions [Citation Graph (, )][DBLP]

  42. Stable partitions in additively separable hedonic games [Citation Graph (, )][DBLP]

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

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

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

Search in 0.004secs, Finished in 0.006secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002