Dominik Wojtczak

I am an EPSRC Postdoctoral Fellow hosted by the Economics&Computation group at the University of Liverpool. Before that I was hosted by the Quantitative Analysis and Verification group at the University of Oxford.

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.

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

email: Dominik.Wojtczak - AT - comlab.ox.ac.uk

algorithmic game theory, efficient analysis of probabilistic systems, computer security, algorithms and theory of automata

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).

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.