1

September 2017
Journal of the ACM (JACM): Volume 64 Issue 5, October 2017

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 0

Downloads (6 Weeks): 12, Downloads (12 Months): 58, Downloads (Overall): 58

Full text available:

PDF
We consider two-person zero-sum stochastic games with signals, a standard model of stochastic games with imperfect information. The only source of information for the players consists of the signals they receive; they cannot directly observe the state of the game, nor the actions played by their opponent, nor their own ...

**Keywords**:
stochastic games, Controller synthesis, algorithmic game theory, imperfect information

2

December 2015
Information and Computation: Volume 245 Issue C, December 2015

**Publisher:** Academic Press, Inc.

We consider two-player zero-sum games on finite-state graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); ...

3

April 2015
ICARSC '15: Proceedings of the 2015 IEEE International Conference on Autonomous Robot Systems and Competitions

**Publisher:** IEEE Computer Society

We present an autonomous robot designed to optimize and to make secure the process of putting vineyard post during trellising. The principle is as follows: The robot goes at the location of the post in an autonomous way with a centimetric accuracy, the user provides the post, and then the ...

**Keywords**:
Autonomous Robotics, Field Robotics, Agricultural Robotics, Viticulture

4

July 2013
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

**Publisher:** Springer-Verlag

We consider the distributed control problem in the setting of Zielonka asynchronous automata. Such automata are compositions of finite processes communicating via shared actions and evolving asynchronously. Most importantly, processes participating in a shared action can exchange complete information about their causal past. This gives more power to controllers, and ...

5

June 2012
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

**Publisher:** IEEE Computer Society

**Bibliometrics**:

Citation Count: 7

Downloads (6 Weeks): 0, Downloads (12 Months): 4, Downloads (Overall): 45

Full text available:

PDF
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently. We sharpen this result, showing that the undecidability holds even if the probabilistic automata have only ...

**Keywords**:
Probabilistic automata, Value 1 problem, Algebraic Techniques in Automata Theory

6

March 2012
FOSSACS'12: Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures

**Publisher:** Springer-Verlag

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist ...

7

August 2010
MFCS'10: Proceedings of the 35th international conference on Mathematical foundations of computer science

**Publisher:** Springer-Verlag

We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) ...

8

July 2010
ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

**Publisher:** Springer-Verlag

Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial ...

9

July 2010
ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

**Publisher:** Springer-Verlag

This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Emptiness Problem asks, given some probability 0 ≤ λ ≤ 1, whether there exists a word accepted with probability greater than λ, and the Isolation Problem ...

10

January 2010
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms

**Publisher:** Society for Industrial and Applied Mathematics

**Bibliometrics**:

Citation Count: 5

Downloads (6 Weeks): 0, Downloads (12 Months): 7, Downloads (Overall): 57

Full text available:

PDF
Infinite stochastic games are a natural model for open reactive processes: one player represents the controller and the other represents a hostile environment. The evolution of the system depends on the decisions of the players, supplemented by chance. There are two main algorithmic problems on such games: computing the values ...

11

August 2009
LICS '09: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science

**Publisher:** IEEE Computer Society

We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning strategies, under reachability, safety, Buchi or co-Buchi winning objectives. We prove two qualitative determinacy results. First, in a reachability game either player $1$ can achieve ...

**Keywords**:
Stochastic games, imperfect information, signals

12

June 2008
CiE '08: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms

**Publisher:** Springer-Verlag

We present a new algorithm for solving Simple Stochastic Games (SSGs), which is fixed parameter tractable when parametrized with the number of random vertices. This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the <em>f-strategies</em>. The running time is <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject Color="BlackWhite" FileRef="MediaObjects/978-3-540-69407-6_24_IEq1_HTML.png" ...

13

March 2008
FOSSACS'08/ETAPS'08: Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures

**Publisher:** Springer-Verlag

We present a new algorithm for solving Simple Stochastic Games (SSGs). This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is O ( | V R |! ċ (| V || E | + | p |) ), ...

14

July 2007
LICS '07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science

**Publisher:** IEEE Computer Society

Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, depending on the payoff function the MDP is equipped with. For example a mean-payoff function evaluates average performance, whereas a discounted payoff function gives more weights ...

15

July 2007
ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming

**Publisher:** Springer-Verlag

We introduce stochastic priority games -- a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority ...

16

February 2007
STACS'07: Proceedings of the 24th annual conference on Theoretical aspects of computer science

**Publisher:** Springer-Verlag

Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. Performances of an MDP are evaluated by a payoff function. The controller of the MDP seeks to optimize those performances, using optimal strategies. There exists various ways of measuring performances, i.e. various classes of payoff functions. For example, ...

17

July 2006
ICALP'06: Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

**Publisher:** Springer-Verlag

Inspired by the paper of de Alfaro, Henzinger and Majumdar [1] about discounted μ -calculus we show new surprising links between parity games and different classes of discounted games

18

August 2005
CONCUR 2005 - Concurrency Theory

**Publisher:** Springer-Verlag

Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, the most popular games in this context are parity games and their cousins (Rabin, Streett and Muller games). Recently however also games with other types of payments, ...

19

February 2005
Electronic Notes in Theoretical Computer Science (ENTCS): Volume 119 Issue 1, February, 2005

**Publisher:** Elsevier Science Publishers B. V.

In a recent paper de Alfaro, Henzinger and Majumdar Luca de Alfaro, Thomas A. Henzinger, and Rupak Majumdar. Discounting the future in systems theory. In ICALP 2003, volume 2719 of LNCS, pages 1022--1037. Springer, 2003] observed that discounting successive payments, the procedure that is employed in the classical stochastic game ...

**Keywords**:
parity games, discounting games