Troels Bjerre Lund

Affiliations:
  • IT-University of Copenhagen, Denmark


According to our database1, Troels Bjerre Lund authored at least 26 papers between 2006 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Computational Complexity of Computing a Quasi-Proper Equilibrium.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2018
Computational Complexity of Proper Equilibrium.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
Computation of Stackelberg Equilibria of Finite Sequential Games.
ACM Trans. Economics and Comput., 2017

2016
Approximate Well-supported Nash Equilibria Below Two-thirds.
Algorithmica, 2016

Timeability of Extensive-Form Games.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2014
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Beat the Cheater: Computing Game-Theoretic Strategies for When to Kick a Gambler out of a Casino.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
On the approximation performance of fictitious play in finite games.
Int. J. Game Theory, 2013

2012
Deterministic Graphical Games Revisited.
J. Log. Comput., 2012

Computing a proper equilibrium of a bimatrix game.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Repeated zero-sum games with budget.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
Solution to Exchanges 9.1 puzzle: borrowing as cheaply as possible.
SIGecom Exch., 2011

Path coalitional games
CoRR, 2011

2010
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2008
Solution to exchanges 7.2 puzzle: strategically choosing products to release.
SIGecom Exch., 2008

Approximability and Parameterized Complexity of Minmax Values.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Fast algorithms for finding proper strategies in game trees.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

On Range of Skill.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Simple Recursive Games
CoRR, 2007

Finding Equilibria in Games of No Chance.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Computing sequential equilibria for two-player games.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Computing Proper Equilibria of Zero-Sum Games.
Proceedings of the Computers and Games, 5th International Conference, 2006


  Loading...