Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Sorensen, Troels Bjerre"'
Autor:
Bosansky, Branislav, Branzei, Simina, Hansen, Kristoffer Arnsfelt, Miltersen, Peter Bro, Sorensen, Troels Bjerre
The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken in favor of
Externí odkaz:
http://arxiv.org/abs/1507.07677
We consider the task of computing an approximation of a trembling hand perfect equilibrium for an n-player game in strategic form, n >= 3. We show that this task is complete for the complexity class FIXP_a. In particular, the task is polynomial time
Externí odkaz:
http://arxiv.org/abs/1408.1017
In an epsilon-Nash equilibrium, a player can gain at most epsilon by changing his behaviour. Recent work has addressed the question of how best to compute epsilon-Nash equilibria, and for what values of epsilon a polynomial-time algorithm exists. An
Externí odkaz:
http://arxiv.org/abs/1204.0707
Autor:
Aziz, Haris, Sørensen, Troels Bjerre
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable
Externí odkaz:
http://arxiv.org/abs/1103.3310
We study the performance of Fictitious Play, when used as a heuristic for finding an approximate Nash equilibrium of a 2-player game. We exhibit a class of 2-player games having payoffs in the range [0,1] that show that Fictitious Play fails to find
Externí odkaz:
http://arxiv.org/abs/1103.1040
Autor:
Hansen, Kristoffer Arnsfelt, Hansen, Thomas Dueholm, Miltersen, Peter Bro, Sørensen, Troels Bjerre
We consider approximating the minmax value of a multi-player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of epsilon log n digits (for any constant epsilon>0 is NP-hard, wh
Externí odkaz:
http://arxiv.org/abs/0806.4344
Autor:
Andersson, Daniel, Hansen, Kristoffer Arnsfelt, Miltersen, Peter Bro, Sorensen, Troels Bjerre
We define the class of "simple recursive games". A simple recursive game is defined as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solvin
Externí odkaz:
http://arxiv.org/abs/0711.1055
Publikováno v:
Economic Theory, 2010 Jan 01. 42(1), 175-192.
Externí odkaz:
https://www.jstor.org/stable/25619982
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.