Troels Bjerre Lund

发表

Solution to exchanges 7.2 puzzle: strategically choosing products to release

Troels Bjerre Lund, T. Lund, 2008, SECO.

On the approximation performance of fictitious play in finite games

Troels Bjerre Lund, Carmine Ventre, Paul W. Goldberg, 2013, Int. J. Game Theory.

The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2010, SAGT.

Approximability and Parameterized Complexity of Minmax Values

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2008, WINE.

Deterministic Graphical Games Revisited

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2008, CiE.

Simple Recursive Games pdf

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2007, ArXiv.

Computing sequential equilibria for two-player games

Peter Bro Miltersen, Troels Bjerre Lund, T. Lund, 2006, SODA '06.

On the approximation performance of fictitious play in finite games pdf

Troels Bjerre Lund, Carmine Ventre, Paul W. Goldberg, 2011, Int. J. Game Theory.

GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs

Troels Bjerre Lund, Tuomas Sandholm, Andrew Gilpin, 2008, AAMAS.

Computation of Stackelberg Equilibria of Finite Sequential Games

Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, 2015, WINE.

Computational Complexity of Proper Equilibrium

Kristoffer Arnsfelt Hansen, Troels Bjerre Lund, T. Lund, 2018, EC.

Computing a proper equilibrium of a bimatrix game

Troels Bjerre Lund, 2012, EC.

Approximate Well-supported Nash Equilibria Below Two-thirds

Troels Bjerre Lund, Paul W. Goldberg, John Fearnley, 2015, Algorithmica.

A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs

Troels Bjerre Lund, Tuomas Sandholm, Andrew Gilpin, 2008, AAMAS.

A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament

Peter Bro Miltersen, Troels Bjerre Lund, 2007, AAMAS '07.

Deterministic Graphical Games Revisited

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2008, J. Log. Comput..

Repeated zero-sum games with budget

Troels Bjerre Lund, 2012, AAMAS.

On Range of Skill

Peter Bro Miltersen, Troels Bjerre Lund, Thomas Dueholm Hansen, 2008, AAAI.

Path coalitional games pdf

Troels Bjerre Lund, Haris Aziz, H. Aziz, 2011, ArXiv.

Approximate Well-Supported Nash Equilibria Below Two-Thirds

Troels Bjerre Lund, Paul W. Goldberg, John Fearnley, 2012, SAGT.

Fast algorithms for finding proper strategies in game trees

Peter Bro Miltersen, Troels Bjerre Lund, T. Lund, 2008, SODA '08.

Beat the Cheater: Computing Game-Theoretic Strategies for When to Kick a Gambler out of a Casino

Troels Bjerre Lund, Vincent Conitzer, Joshua Letchford, 2014, AAAI.

The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form pdf

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2014, SAGT.

Timeability of Extensive-Form Games

Troels Bjerre Lund, Vincent Conitzer, Sune K. Jakobsen, 2015, ITCS.

Computing Proper Equilibria of Zero-Sum Games

Peter Bro Miltersen, Troels Bjerre Lund, T. Lund, 2006, Computers and Games.

Finding Equilibria in Games of No Chance

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2007, COCOON.

Solution to Exchanges 9.1 puzzle: borrowing as cheaply as possible

Troels Bjerre Lund, Nikos Karanikolas, Maria Kyropoulou, 2011, SECO.

Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker

Troels Bjerre Lund, Tuomas Sandholm, Andrew Gilpin, 2007, AAAI.

Computational Complexity of Computing a Quasi-Proper Equilibrium

Kristoffer Arnsfelt Hansen, Troels Bjerre Lund, 2021, FCT.