Showing 1–20 of 29 results
/ Date/ Name
Apr 22, 2013Monte Carlo *-Minimax SearchMay 31, 2019Foundations of Digital ArchæoludologyJan 18, 2023Implicit State and Goals in QBF Encodings for Positional Games (extended version)Sep 27, 2018How does uncertainty about other voters determine a strategic vote?May 11, 2020Positional Games and QBF: A Polished EncodingMay 16, 2016On the Complexity of Connection GamesJul 8, 2012Minimal Proof Search for Modal Logic K Model CheckingMar 25, 2014Havannah and TwixT are PSPACE-completeJun 29, 2020On Bellman's Optimality Principle for zs-POSGsOct 26, 2022HSVI can solve zero-sum Partially Observable Stochastic GamesOct 23, 2013Strategic Voting and the Logic of KnowledgeFeb 15, 2024A Piecewise Approach for the Analysis of Exact AlgorithmsMay 8, 2018The Complexity of Limited Belief Reasoning -- The Quantifier-Free CaseSep 3, 2024Fair Railway Network DesignApr 27, 2024Generalizing Roberts' characterization of unit interval graphsJun 14, 2025Polynomial Prenexing of QBFs with Non-Monotone Boolean OperatorsJun 9, 2019The Packed Interval Covering Problem is NP-completeMay 23, 2024Mixture of Public and Private Distributions in Imperfect Information GamesMay 23, 2024Deep Reinforcement Learning for 5*5 Multiplayer GoFeb 26, 2023Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search