Skip to main content

2 Result(s)

within Computer Applications Remove this filter Computers and Society Remove this filter Numeric Computing Remove this filter Felix Brandt Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    The Computational Complexity of Weak Saddles

    We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a polynomial-time algorithm for computing w...

    Felix Brandt, Markus Brill, Felix Fischer, Jan Hoffmann in Algorithmic Game Theory (2009)

  2. No Access

    Chapter and Conference Paper

    On the Complexity of Iterated Weak Dominance in Constant-Sum Games

    In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and sometimes strictly better. We investigate the...

    Felix Brandt, Markus Brill, Felix Fischer, Paul Harrenstein in Algorithmic Game Theory (2009)