World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
4031
World Ranking
14076
National Ranking
681

Overview

Felix Brandt is affiliated with the Technical University of Munich in Germany. Their research focuses primarily on the fields of Economics, Econometrics and Finance, with significant contributions to Decision Sciences.

The main subfields of study include Economics and Econometrics, Management Science and Operations Research, General Decision Sciences, Safety Research, and Finance. Their work covers a range of topics centered around game theory and economic behavior.

  • Game Theory and Voting Systems
  • Game Theory and Applications
  • Auction Theory and Applications
  • Decision-Making and Behavioral Economics
  • Economic theories and models
  • Experimental Behavioral Economics Studies
  • Economic and Environmental Valuation

Felix Brandt has published extensively, with notable papers including:

  • Finding and Recognizing Popular Coalition Structures, 2022, Journal of Artificial Intelligence Research
  • Funding public projects: A case for the Nash product rule, 2021, Journal of Mathematical Economics
  • Reaching Individually Stable Coalition Structures in Hedonic Games, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • An analytical and experimental comparison of maximal lottery schemes, 2021, Social Choice and Welfare
  • Reaching Individually Stable Coalition Structures, 2023, ACM Transactions on Economics and Computation

Frequent coauthors collaborating with Felix Brandt include Patrick Lederer, Warut Suksompong, Martin Bullinger, Florian Brandl, and Anaëlle Wilczynski.

Publications are often found in venues such as:

  • arXiv (Cornell University)
  • Social Choice and Welfare
  • Journal of Artificial Intelligence Research
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Theoretical Economics

Best Publications

  • Handbook of Computational Social Choice

    Felix Brandt;Vincent Conitzer;Ulle Endriss;Jérôme Lang;Jérôme Lang

  • Computational Social Choice

    F. Brandt;U. Endriss

  • Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates

    Felix Brandt;Markus Brill;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Efficient cryptographic protocol design based on distributed el gamal encryption

    Felix Brandt

  • Fractional Hedonic Games

    Haris Aziz;Florian Brandl;Felix Brandt;Paul Harrenstein

  • Computing desirable partitions in additively separable hedonic games

    Haris Aziz;Felix Brandt;Hans Georg Seedig

  • Fully Private Auctions in a Constant Number of Rounds

    Felix Brandt

  • Pareto optimality in coalition formation

    Haris Aziz;Felix Brandt;Paul Harrenstein

  • Spiteful bidding in sealed-bid auctions

    Felix Brandt;Tuomas Sandholm;Yoav Shoham

  • Symmetries and the complexity of pure Nash equilibrium

    Felix Brandt;Felix Fischer;Markus Holzer

  • How to obtain full privacy in auctions

    Felix Brandt

  • The Computational Complexity of Choice Sets

    Felix Brandt;Felix A. Fischer;Paul Harrenstein

  • Consistent Probabilistic Social Choice

    Florian Brandl;Felix Brandt;Hans Georg Seedig

  • Antisocial Agents and Vickrey Auctions

    Felix Brandt;Gerhard Weiß

  • The computational complexity of random serial dictatorship

    Haris Aziz;Felix Brandt;Markus Brill

  • Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates

    Felix Brandt;Markus Brill;Edith Hemaspaandra;Lane A. Hemaspaandra

  • Finding strategyproof social choice functions via SAT solving

    Felix Brandt;Christian Geist

  • Introduction to Computational Social Choice

    Felix Brandt;Vincent Conitzer;Ulle Endriss;Jérôme Lang

  • On the Existence of Unconditionally Privacy-Preserving Auction Protocols

    Felix Brandt;Tuomas Sandholm

  • A computational analysis of the tournament equilibrium set

    Felix Brandt;Felix Fischer;Paul Harrenstein;Maximilian Mair

  • Stable partitions in additively separable hedonic games

    Haris Aziz;Felix Brandt;Hans Georg Seedig

  • Minimal stable sets in tournaments

    Felix Brandt

  • On the tradeoff between economic efficiency and strategy proofness in randomized social choice

    Haris Aziz;Felix Brandt;Markus Brill

  • A verifiable, bidder-resolved Auction Protocol

    Felix Brandt

  • Fractional hedonic games

    Haris Aziz;Felix Brandt;Paul Harrenstein

  • Optimal partitions in additively separable hedonic games

    Haris Aziz;Felix Brandt;Hans Georg Seedig

  • Computational Social Choice: Prospects and Challenges

    Ulle Endriss

Frequent Co-Authors

Haris Aziz
Haris Aziz University of New South Wales
Tuomas Sandholm
Tuomas Sandholm Carnegie Mellon University
Vincent Conitzer
Vincent Conitzer Carnegie Mellon University
Yoav Shoham
Yoav Shoham Stanford University
Lane A. Hemaspaandra
Lane A. Hemaspaandra University of Rochester
Jörg Rothe
Jörg Rothe Heinrich Heine University Düsseldorf
Ulle Endriss
Ulle Endriss University of Amsterdam
Jérôme Lang
Jérôme Lang Paris Dauphine University
Ariel D. Procaccia
Ariel D. Procaccia Harvard University
Edith Hemaspaandra
Edith Hemaspaandra Rochester Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to a variety of flexible educational and career options. Many students begin with online associate degree programs, which offer foundational skills for entry-level roles or further study—all from the comfort of home.

For those concerned about expenses, there are a wide range of cheap online colleges providing high-quality instruction without breaking the bank. These accredited institutions help make computer science degrees more accessible and affordable.

If your academic record is not perfect, don’t worry—there are many reputable college with low gpa requirements, offering a second chance for motivated learners who want to advance their careers.

Graduates in computer science can access diverse career opportunities, similar to other fields. If you are curious about the diverse prospects in science degrees, consider reviewing what roles are available with an what jobs can you get with an environmental science degree for inspiration on how your skills can translate to the job market.

Best Scientists Citing Felix Brandt

Trending Scientists

Recently Published Articles