Dominik Wojtczak

I graduated with a PhD from the University of Edinburgh at the beginning of 2009 and worked that year as a postdoc at Centrum Wiskunde & Informatica (CWI) in Amsterdam. After that I was an EPSRC Postdoctoral Fellow at the University of Oxford and a member of the Quantitative Analysis and Verification group.

Contact details

Department of Computer Science
Ashton Building
Ashton Street
LIVERPOOL, L69 3BX
UK

phone: (+44) 151 795 4252 

email: D.Wojtczak - AT - liverpool.ac.uk

Interests

probabilistic systems, game theory, coalition games, control theory, verification of embedded systems

Teaching

• 2015-- COMP 218 Decision, Computation and Language (i.e. automata theory)
• 2013    COMP 109 Foundations of Computer Science
• 2012-- COMP 516 Research Methods in Computer Science

Software

• PReMo
  
• Spookey
  

PhD students

• Mahmoud Mousa (2014- ) who studies optimal control in embedded systems
• Mehmet Kurucan (2013- ) who studies learning of statistical models

Selected publications

• Sunil Simon and Dominik Wojtczak. Synchronisation Games on Hypergraphs. To appear in IJCAI 2017.
• Krzysztof Apt, Eryk Kopczynski, and Dominik Wojtczak. On the Computational Complexity of Gossip Protocols. To appear in IJCAI 2017.
• Richard Mayr, Sven Schewe, Patrick Totzke and Dominik Wojtczak. MDPs with Energy-Parity Objectives. To appear in LICS 2017.
• Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Dominik Wojtczak. On Strong Determinacy of Countable Stochastic Games. To appear in LICS 2017.
• Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi and Dominik Wojtczak. Parity Objectives in Countable MDPs. To appear in LICS 2017.
• John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan and Dominik Wojtczak. An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. To appear in SPIN 2017.
• Krzysztof Apt and Dominik Wojtczak. Decidability of Fair Termination of Gossip Protocols. To appear in LPAR 2017.
• Sunil Simon, Dominik Wojtczak. Constrained Nash Equilibria in Polymatrix Games. In Proc. of AAAI 2017.
• Mahmoud A. A. Mousa, Sven Schewe and Dominik Wojtczak. Optimal Control for Simple Linear Hybrid Systems. In Proc. of TIME 2016.
• Sunil Simon, Dominik Wojtczak. Efficient Local Search in Coordination Games on Graphs. In Proc. of IJCAI 2016.
• Krzysztof R. Apt, Dominik Wojtczak. On Decidability of a Logic of Gossips. In Proc. of JELIA 2016.
• Ankush Das, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi, Dominik Wojtczak. On Pure Nash Equilibria in Stochastic Games. In Proc. of TAMC 2015.
• Anshul Gupta, Sven Schewe, Dominik Wojtczak. Making the Best of Limited Memory in Multi-Player Discounted Sum Games. In Proc. of GandALF 2015.
• Krzysztof R. Apt, Sunil Simon, Dominik Wojtczak. Coordination Games on Directed Graphs. In Proc. of TARK 2015
• Krishnendu Chatterjee, Vojtech Forejt, Dominik Wojtczak. Multi-objective Discounted Reward Verification in Graphs and MDPs. In Proc. of LPAR 2013.
• Dominik Wojtczak: Optimal Control for Linear-Rate Multi-mode Systems. In Proc. of FORMATS 2013.
• Dominik Wojtczak. Expected Termination Time in BPA Games. In Proc. of ATVA 2013.
• Optimal scheduling for constant-rate multi-mode systems (with R. Alur and A. Trivedi).
  In Proceedings of HSCC 2012. (BEST PAPER AWARD)
• Minimizing Expected Termination Time in One-Counter Markov Decision Processes (with Tomás Brázdil, Antonín Kucera, Petr Novotný).
  In Proceedings of ICALP (2) 2012.
• Trust metrics for the SPKI/SDSI authorisation framework.
  In Proceedings of 9th International Symposium on Automated Technology for Verification and Analysis (ATVA 2011).
• The Complexity of Nash Equilibria in Limit-Average Games. (with M. Ummels)
  In Proceedings of 22nd International Conference on Concurrency Theory (CONCUR 2011).
• On Probabilistic Parallel Programs with Process Creation and Synchronisation. (with S. Kiefer)
  In Proceedings of 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2011).
  Technical report.
• Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata and Pushdown Systems. (with K. Etessami and M. Yannakakis)
  Performance Evaluation, vol. 67(9), pp. 837-857.
  Preprint --- Link to the journal article.
• Recursive Timed Automata. (with A. Trivedi)
  In Proceedings of 8th International Symposium on Automated Technology for Verification and Analysis (ATVA 2010).
• Timed Branching Processes. (with A. Trivedi)
  In Proceedings of 7th International Conference on the Quantitative Evaluation of SysTems (QEST 2010).
• One-counter Markov Decision Processes (with V. Brozek, T. Brazdil, K. Etessami and A. Kucera)
  In Proceedings of 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2010).
  Technical report
• Decision Problems for Nash Equilibria in Stochastic Games (with M. Ummels)
  In Proceedings of 18th Annual Conference on Computer Science Logic (CSL'09).
  Technical Report --- link to the slides from the talk.
• The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. (with M. Ummels)
  In Proceedings of 36th International Colloquium on Automata, Languages and Programming (ICALP'09 (Track B)). (BEST STUDENT PAPER AWARD).
Technical Report --- link to the slides from the talk.
• Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata and Pushdown Systems.
  (with K. Etessami and M. Yannakakis)
  In Proceedings of 5th International Conference on the Quantitative Evaluation of SysTems (QEST'08).
  Technical report ---- slides from the talk and slides for print.
• Recursive Stochastic Games with Positive Rewards. (with K. Etessami and M. Yannakakis)
  In Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP'08 (Track A)).
  Technical report ----- slides from the talk and slides for print.
• PReMo: an analyzer for Probabilistic Recursive Models. (with K. Etessami)
  In Proceedings of 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'07).
  Technical report --- slides from the talk and slides for print.