Wieslaw Zielonka

Publication Activity (10 Years)

Years Active: 1987-2016
Publications (10 Years): 1

Top Topics

Incomplete Information

Payoff Functions

Nash Equilibria

Top Venues

Int. J. Found. Comput. Sci.

Publications

Hugo Gimbert, Wieslaw Zielonka
Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences. CoRR (2016)
Bruno Karelovic, Wieslaw Zielonka
Nearest Fixed Points and Concurrent Priority Games. FCT (2015)
Hugo Gimbert, Jérôme Renault, Sylvain Sorin, Xavier Venel, Wieslaw Zielonka
On the values of repeated games with signals. CoRR (2014)
Hugo Gimbert, Wieslaw Zielonka
Blackwell Optimal Strategies in Priority mean-Payoff Games. Int. J. Found. Comput. Sci. 23 (3) (2012)
Hugo Gimbert, Wieslaw Zielonka
Blackwell-Optimal Strategies in Priority Mean-Payoff Games GANDALF (2010)
Wieslaw Zielonka
Playing in stochastic environment: from multi-armed bandits to two-player games. FSTTCS (2010)
Hugo Gimbert, Wieslaw Zielonka
Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games. Logic and Automata (2008)
Hugo Gimbert, Wieslaw Zielonka
Limits of Multi-Discounted Markov Decision Processes. LICS (2007)
Hugo Gimbert, Wieslaw Zielonka
Perfect Information Stochastic Priority Games. ICALP (2007)
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae 74 (1) (2006)
Wieslaw Zielonka
Time-stamps for Mazurkiewicz traces. Theor. Comput. Sci. 356 (1-2) (2006)
Hugo Gimbert, Wieslaw Zielonka
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. ICALP (2) (2006)
Hugo Gimbert, Wieslaw Zielonka
Discounting Infinite Games But How and Why? Electron. Notes Theor. Comput. Sci. 119 (1) (2005)
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS 85 (2005)
Hugo Gimbert, Wieslaw Zielonka
Games Where You Can Play Optimally Without Any Memory. CONCUR (2005)
Wieslaw Zielonka
An Invitation to Play. MFCS (2005)
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
Election, Naming and Cellular Edge Local Computations. ICGT (2004)
Wieslaw Zielonka
Perfect-Information Stochastic Parity Games. FoSSaCS (2004)
Hugo Gimbert, Wieslaw Zielonka
When Can You Play Positionally? MFCS (2004)
Wieslaw Zielonka
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. Theor. Comput. Sci. 200 (1-2) (1998)
François Demichelis, Wieslaw Zielonka
Controlled Timed Automata. CONCUR (1998)
Igor Litovsky, Yves Métivier, Wieslaw Zielonka
On the Recognition of Families of Graphs with Local Computations Inf. Comput. 118 (1) (1995)
Paul Gastin, Antoine Petit, Wieslaw Zielonka
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. Theor. Comput. Sci. 125 (2) (1994)
Robert Cori, Yves Métivier, Wieslaw Zielonka
Asynchronous Mappings and Asynchronous Cellular Automata Inf. Comput. 106 (2) (1993)
Igor Litovsky, Yves Métivier, Wieslaw Zielonka
The Power and the Limitations of Local Computations on Graphs. WG (1992)
Mireille Clerbout, Yves Roos, Wieslaw Zielonka
Semi-Commutations and Rational Expressions. ICALP (1992)
Paul Gastin, Antoine Petit, Wieslaw Zielonka
A Kleene Theorem for Infinite Trace Languages. ICALP (1991)
Wieslaw Zielonka
Safe Executions of Recognizable Trace Languages by Asynchronous Automata. Logic at Botik (1989)
Wieslaw Zielonka
Notes on Finite Asynchronous Automata. RAIRO Theor. Informatics Appl. 21 (2) (1987)