| Publication | Date of Publication | Type |
|---|
Playing (almost-)optimally in concurrent Büchi and co-Büchi games
| 2024-09-12 | Paper |
Optimal strategies in concurrent reachability games
| 2024-04-10 | Paper |
Finite-memory strategies in two-player infinite games
| 2024-04-10 | Paper |
scientific article; zbMATH DE number 7799619 (Why is no real title available?)
| 2024-02-05 | Paper |
Subgame optimal strategies in finite concurrent games with prefix-independent objectives
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Time-aware uniformization of winning strategies
| 2022-12-16 | Paper |
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559480 (Why is no real title available?)
| 2022-07-18 | Paper |
Games where you can play optimally with arena-independent finite memory
| 2022-02-09 | Paper |
An existence theorem of Nash equilibrium in Coq and Isabelle
| 2021-12-14 | Paper |
Dynamics and coalitions in sequential games
| 2021-12-14 | Paper |
A semi-potential for finite and infinite sequential games (extended abstract)
| 2021-12-07 | Paper |
Concurrent games and semi-random determinacy
| 2021-08-04 | Paper |
Equilibria in multi-player multi-outcome infinite sequential games
Information and Computation | 2021-02-08 | Paper |
On the existence of weak subgame perfect equilibria
Information and Computation | 2021-02-08 | Paper |
On the termination of dynamics in sequential games
Information and Computation | 2020-05-26 | Paper |
A semi-potential for finite and infinite games in extensive form
Dynamic Games and Applications | 2020-04-29 | Paper |
Connected choice and the Brouwer fixed point theorem
Journal of Mathematical Logic | 2019-07-08 | Paper |
Memoryless determinacy of infinite parity games: another simple proof
Information Processing Letters | 2019-01-18 | Paper |
Minkowski games
ACM Transactions on Computational Logic | 2018-10-24 | Paper |
The complexity of graph-based reductions for reachability in Markov decision processes
| 2018-07-17 | Paper |
Extending finite-memory determinacy to multi-player games
Information and Computation | 2018-06-14 | Paper |
Infinite sequential games with real-valued payoffs
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
scientific article; zbMATH DE number 6862142 (Why is no real title available?)
| 2018-04-19 | Paper |
Stable states of perturbed Markov chains
| 2018-03-21 | Paper |
On the existence of weak subgame perfect equilibria
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Multi-scale metastable dynamics and the asymptotic stationary distribution of perturbed Markov chains
Stochastic Processes and their Applications | 2016-10-12 | Paper |
The Brouwer fixed point theorem revisited
Pursuit of the Universal | 2016-08-17 | Paper |
Static analysis by abstract interpretation: a mathematical programming approach
Electronic Notes in Theoretical Computer Science | 2016-06-17 | Paper |
Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Finite choice, convex choice and finding roots
Logical Methods in Computer Science | 2016-01-07 | Paper |
Weihrauch degrees of finding equilibria in sequential games
Evolving Computability | 2015-10-20 | Paper |
From winning strategy to Nash equilibrium
Mathematical Logic Quarterly (MLQ) | 2014-10-10 | Paper |
Mathematical programming based debugging
| 2013-11-08 | Paper |
A machine-checked proof of the odd order theorem
Interactive Theorem Proving | 2013-08-07 | Paper |
Closed choice for finite and for convex sets
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Infinite sequential Nash equilibrium
Logical Methods in Computer Science | 2013-06-20 | Paper |
Singular coverings and non-uniform notions of closed set computability
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
On the computational content of the Brouwer fixed point theorem
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Non-determinism and Nash equilibria for sequential game over partial order
| 2010-07-28 | Paper |
Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Singular coverings and non‐uniform notions of closed set computability
Mathematical Logic Quarterly | 2008-10-08 | Paper |
Graphs and Path Equilibria
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Computable Closed Euclidean Subsets with and without Computable Points
| 2006-10-13 | Paper |
scientific article; zbMATH DE number 1140538 (Why is no real title available?)
| 1998-11-01 | Paper |
scientific article; zbMATH DE number 530109 (Why is no real title available?)
| 1994-04-26 | Paper |
