Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Sven Schewe
Computer Science > Computer Science and Game Theory
We investigate memory requirements for Nash and subgame-perfect equilibria in turn-based deterministic games with $ω$-regular objectives. We prove that memoryless randomised (i.e., stationary) subgame-perfect equilibria always exist in games with reachability, safety, and 0-2 Muller objectives (i.e., Muller objectives for which accepting sets are either up- or downward closed), and any combination of these objectives.
[2511.09073] Good-for-MDP State Reduction for Stochastic LTL Planning
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2404.04124] An Objective Improvement Approach to Solving Discounted Payoff Games
[Submitted on 4 Apr 2024 ( v1 ), last revised 21 Aug 2025 (this version, v4)] Title:An Objective Improvement Approach to Solving Discounted Payoff Games View a PDF of the paper titled An Objective Improvement Approach to Solving Discounted Payoff Games, by Daniele Dell'Erba and Arthur Dumas and Sven Schewe View PDF HTML (experimental) Abstract:While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not.
[2308.07469] Omega-Regular Reward Machines
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2307.07490] A novel family of finite automata for recognizing and learning $ω$-regular languages
arXiv:2307.07490 (cs) Download a PDF of the paper titled A novel family of finite automata for recognizing and learning $\omega$-regular languages, by Yong Li and 2 other authors Download PDF Submission history From: Qiyi Tang [ view email] [v1] Fri, 14 Jul 2023 17:22:44 UTC (578 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Links to...
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Sven
Contact Sven, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack