default search action
Troels Bjerre Lund
Person information
- affiliation: IT-University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c22]Kristoffer Arnsfelt Hansen
, Troels Bjerre Lund:
Computational Complexity of Computing a Quasi-Proper Equilibrium. FCT 2021: 259-271 - [i9]Kristoffer Arnsfelt Hansen, Troels Bjerre Lund:
Computational Complexity of Computing a Quasi-Proper Equilibrium. CoRR abs/2107.04300 (2021)
2010 – 2019
- 2018
- [c21]Kristoffer Arnsfelt Hansen
Computational Complexity of Proper Equilibrium. EC 2018: 113-130 - 2017
- [j6]Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen
Computation of Stackelberg Equilibria of Finite Sequential Games. ACM Trans. Economics and Comput. 5(4): 23:1-23:24 (2017) - 2016
- [j5]John Fearnley, Paul W. Goldberg
Approximate Well-supported Nash Equilibria Below Two-thirds. Algorithmica 76(2): 297-319 (2016) - [c20]Sune K. Jakobsen, Troels Bjerre Sørensen, Vincent Conitzer:
Timeability of Extensive-Form Games. ITCS 2016: 191-199 - 2015
- [c19]Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen
Computation of Stackelberg Equilibria of Finite Sequential Games. WINE 2015: 201-215 - [i8]Sune K. Jakobsen, Troels Bjerre Sørensen, Vincent Conitzer:
Timeability of Extensive-Form Games. CoRR abs/1502.03430 (2015) - [i7]Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Computation of Stackelberg Equilibria of Finite Sequential Games. CoRR abs/1507.07677 (2015) - 2014
- [c18]Troels Bjerre Sørensen, Melissa Dalis, Joshua Letchford, Dmytro Korzhyk, Vincent Conitzer:
Beat the Cheater: Computing Game-Theoretic Strategies for When to Kick a Gambler out of a Casino. AAAI 2014: 798-804 - [c17]Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. SAGT 2014: 231-243 - [i6]Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form. CoRR abs/1408.1017 (2014) - 2013
- [j4]Paul W. Goldberg
On the approximation performance of fictitious play in finite games. Int. J. Game Theory 42(4): 1059-1083 (2013) - 2012
- [j3]Daniel Andersson, Kristoffer Arnsfelt Hansen
Deterministic Graphical Games Revisited. J. Log. Comput. 22(2): 165-178 (2012) - [c16]Troels Bjerre Sørensen:
Repeated zero-sum games with budget. AAMAS 2012: 829-836 - [c15]John Fearnley, Paul W. Goldberg
Approximate Well-Supported Nash Equilibria Below Two-Thirds. SAGT 2012: 108-119 - [c14]Troels Bjerre Sørensen:
Computing a proper equilibrium of a bimatrix game. EC 2012: 916-928 - [i5]John Fearnley, Paul W. Goldberg, Rahul Savani
Approximate Well-supported Nash Equilibria below Two-thirds. CoRR abs/1204.0707 (2012) - 2011
- [j2]Nikos Karanikolas, Maria Kyropoulou, Troels Bjerre Sørensen:
Solution to Exchanges 9.1 puzzle: borrowing as cheaply as possible. SIGecom Exch. 10(2): 51-52 (2011) - [c13]Paul W. Goldberg
On the Approximation Performance of Fictitious Play in Finite Games. ESA 2011: 93-105 - [i4]Paul W. Goldberg, Rahul Savani
On the Approximation Performance of Fictitious Play in Finite Games. CoRR abs/1103.1040 (2011) - [i3]Haris Aziz, Troels Bjerre Sørensen:
Path coalitional games. CoRR abs/1103.3310 (2011) - 2010
- [c12]Kristoffer Arnsfelt Hansen
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. SAGT 2010: 198-209
2000 – 2009
- 2008
- [j1]Troels Bjerre Sørensen:
Solution to exchanges 7.2 puzzle: strategically choosing products to release. SIGecom Exch. 7(3) (2008) - [c11]Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
On Range of Skill. AAAI 2008: 277-282 - [c10]Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen:
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs. AAMAS (2) 2008: 911-918 - [c9]Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen:
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs. AAMAS (Demos) 2008: 1647-1648 - [c8]Daniel Andersson, Kristoffer Arnsfelt Hansen
Deterministic Graphical Games Revisited. CiE 2008: 1-10 - [c7]Peter Bro Miltersen, Troels Bjerre Sørensen:
Fast algorithms for finding proper strategies in game trees. SODA 2008: 874-883 - [c6]Kristoffer Arnsfelt Hansen
Approximability and Parameterized Complexity of Minmax Values. WINE 2008: 684-695 - [i2]Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Approximability and parameterized complexity of minmax values. CoRR abs/0806.4344 (2008) - 2007
- [c5]Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen:
Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker. AAAI 2007: 50-57 - [c4]Peter Bro Miltersen, Troels Bjerre Sørensen:
A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament. AAMAS 2007: 191 - [c3]Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Finding Equilibria in Games of No Chance. COCOON 2007: 274-284 - [i1]Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Simple Recursive Games. CoRR abs/0711.1055 (2007) - 2006
- [c2]Peter Bro Miltersen, Troels Bjerre Sørensen:
Computing Proper Equilibria of Zero-Sum Games. Computers and Games 2006: 200-211 - [c1]Peter Bro Miltersen, Troels Bjerre Sørensen:
Computing sequential equilibria for two-player games. SODA 2006: 107-116
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: