Marcin Jurdzinski

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 28

Top Topics

Probabilistic Automata

Solution Concepts

Nash Equilibria

Top Venues

Publications

Rohan Acharya, Marcin Jurdzinski, Aditya Prakash
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. CoRR (2024)
Rohan Acharya, Marcin Jurdzinski, Aditya Prakash
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. ICALP (2024)
K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. FSTTCS (2022)
Marcin Jurdzinski, Rémi Morvan, K. S. Thejaswini
Universal Algorithms for Parity Games and Nested Fixpoints. Principles of Systems Design (2022)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119 (2021)
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini
The Strahler Number of a Parity Game. ICALP (2020)
Marcin Jurdzinski, Rémi Morvan
A Universal Attractor Decomposition Algorithm for Parity Games. CoRR (2020)
Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini
The Strahler number of a parity game. CoRR (2020)
Marcin Jurdzinski, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini
A symmetric attractor-decomposition lifting algorithm for parity games. CoRR (2020)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA (2019)
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
Alternating Weak Automata from Universal Trees. CONCUR (2019)
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81 (3) (2019)
Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
Alternating Weak Automata from Universal Trees. CoRR (2019)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. CoRR (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic
A pseudo-quasi-polynomial algorithm for mean-payoff parity games. LICS (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When is Containment Decidable for Probabilistic Automata?. ICALP (2018)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR (2018)
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
When is Containment Decidable for Probabilistic Automata? CoRR (2018)
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Perfect half space games. LICS (2017)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Zero-Sum Game Techniques for Approximate Nash Equilibria. AAMAS (2017)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Multi-player Approximate Nash Equilibria. AAMAS (2017)
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Perfect Half Space Games. CoRR (2017)
Marcin Jurdzinski, Ranko Lazic
Succinct progress measures for solving parity games. CoRR (2017)
Marcin Jurdzinski, Ranko Lazic
Succinct progress measures for solving parity games. LICS (2017)
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
Distributed Methods for Computing Approximate Equilibria. WINE (2016)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract). AAMAS (2016)
Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, Ashutosh Trivedi
Mean-Payoff Games on Timed Automata. CoRR (2016)
Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, Ashutosh Trivedi
Mean-Payoff Games on Timed Automata. FSTTCS (2016)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Approximate Nash Equilibria with Near Optimal Social Welfare. IJCAI (2015)
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. ICALP (2) (2015)
John Fearnley, Marcin Jurdzinski
Reachability in two-clock timed automata is PSPACE-complete. Inf. Comput. 243 (2015)
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis, John Fearnley, Marcin Jurdzinski, Rahul Savani
Distributed Methods for Computing Approximate Equilibria. CoRR (2015)
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. CoRR (2015)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games. SAGT (2014)
Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski
Approximate well-supported Nash equilibria in symmetric bimatrix games. CoRR (2014)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski
Stochastic Timed Automata. Log. Methods Comput. Sci. 10 (4) (2014)
John Fearnley, Marcin Jurdzinski
Reachability in Two-Clock Timed Automata is PSPACE-complete CoRR (2013)
John Fearnley, Marcin Jurdzinski
Reachability in Two-Clock Timed Automata Is PSPACE-Complete. ICALP (2) (2013)
Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79 (1) (2013)
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet
Almost-Sure Model-Checking of Reactive Timed Automata. QEST (2012)
Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski
Average-price-per-reward games on hybrid automata with strong resets. Int. J. Softw. Tools Technol. Transf. 13 (6) (2011)
Marcin Jurdzinski, Ranko Lazic
Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12 (3) (2011)
John Fearnley, Marcin Jurdzinski, Rahul Savani
Linear Complementarity Algorithms for Infinite Games. SOFSEM (2010)
Marcin Jurdzinski, Ashutosh Trivedi
Reachability-time games on timed automata CoRR (2009)
Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI (2009)
John Fearnley, Marcin Jurdzinski, Rahul Savani
Linear Complementarity Algorithms for Infinite Games CoRR (2009)
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Trivedi
Concavely-Priced Probabilistic Timed Automata. CONCUR (2009)
Marcin Jurdzinski
Algorithms for Solving Infinite Games. SOFSEM (2009)
Marcin Jurdzinski, Ashutosh Trivedi
Average-Time Games on Timed Automata CoRR (2009)
Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS (2009)
Marcin Jurdzinski, Mike Paterson, Uri Zwick
A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. 38 (4) (2008)
Marcin Jurdzinski, Jeremy Sproston, François Laroussinie
Model Checking Probabilistic Timed Automata with One or Two Clocks. Log. Methods Comput. Sci. 4 (3) (2008)
Marcin Jurdzinski, Ashutosh Trivedi
Concavely-Priced Timed Automata. FORMATS (2008)
Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
Model Checking Probabilistic Timed Automata with One or Two Clocks CoRR (2008)
Marcin Jurdzinski, Ranko Lazic
Alternating Automata on Data Trees and XPath Satisfiability CoRR (2008)
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS (2008)
Marcin Jurdzinski, Ashutosh Trivedi
Average-Time Games. FSTTCS (2008)
Marcin Jurdzinski, Rahul Savani
A Simple P-Matrix Linear Complementarity Problem for Discounted Games. CiE (2008)
Marcin Jurdzinski, Ranko Lazic
Alternation-free modal mu-calculus for data trees. LICS (2007)
P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel
07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation (2007)
Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS (2007)
Marcin Jurdzinski, Ashutosh Trivedi
Reachability-Time Games on Timed Automata. ICALP (2007)
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
Games with secure equilibria. Theor. Comput. Sci. 365 (1-2) (2006)
Marcin Jurdzinski, Mike Paterson, Uri Zwick
A deterministic subexponential algorithm for solving parity games. SODA (2006)
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
Mean-Payoff Parity Games. LICS (2005)
Marcin Jurdzinski, Doron A. Peled, Hongyang Qu
Calculating Probabilities of Real-Time Test Cases. FATES (2005)
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
Quantitative stochastic parity games. SODA (2004)
Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski
On Nash Equilibria in Stochastic Games. CSL (2004)
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
Games with Secure Equilibria. FMCO (2004)
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
Games with Secure Equilibria. LICS (2004)
Marcin Jurdzinski, Mogens Nielsen, Jirí Srba
Undecidability of domino games and hhp-bisimilarity. Inf. Comput. 184 (2) (2003)
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
Simple Stochastic Parity Games. CSL (2003)
Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger
Trading Probability for Fairness. CSL (2002)
Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, Marcin Jurdzinski, Freddy Y. C. Mang
Interface Compatibility Checking for Software Modules. CAV (2002)
Marcin Jurdzinski, Mogens Nielsen
Hereditary History Preserving Bisimilarity Is Undecidable. STACS (2000)
Marcin Jurdzinski
Small Progress Measures for Solving Parity Games. STACS (2000)
Jens Vöge, Marcin Jurdzinski
A Discrete Strategy Improvement Algorithm for Solving Parity Games. CAV (2000)
Marcin Jurdzinski
Deciding the Winner in Parity Games is in UP \cap co-Up. Inf. Process. Lett. 68 (3) (1998)
Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz
How Much Memory is Needed to Win Infinite Games? LICS (1997)