Skip to main navigation
Skip to search
Skip to main content
Technical University of Munich Home
Help & FAQ
English
Deutsch
Home
Profiles
Research units
Projects
Research output
Datasets
Prizes
Activities
Press/Media
Impacts
Search by expertise, name or affiliation
Computing dominance-based solution concepts
Felix Brandt
, Markus Brill
Informatics 18 - Associate Professorship of Algorithmic Game Theory
University of Oxford
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Computing dominance-based solution concepts'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Solution Concepts
100%
Cover Set
66%
Minimal Covering
66%
Computational Complexity
33%
Generic Algorithm
33%
Symmetric Matrices
33%
Unifying Framework
33%
Weibull
33%
Computational Properties
33%
Computational Intractability
33%
Normal Form Games
33%
Nash Equilibrium
33%
Set-valued
33%
Matrix Game
33%
Harsanyi
33%
Breton
33%
Shapley's Saddles
33%
Two-player Games
33%
Polynomial-time Computability
33%
Epistemic Assumptions
33%
Minimal Solution
33%
Mathematics
Symmetric Matrix
100%
Generic Algorithm
100%
Valued Set
100%
Intractability
100%
Matrix Game
100%
Nash Equilibrium
100%
Polynomial Time
100%
Minimal Solution
100%
Engineering
Solution Concept
100%
Covering Set
66%
Polynomial Time
33%
Normal Form Game
33%
Computational Complexity
33%
Minimal Solution
33%
Symmetric Matrix
33%
Nash Equilibrium
33%
Matrix Game
33%