Search for dissertations about: "mean payoff games"

Found 4 swedish dissertations containing the words mean payoff games.

  1. 1. Games and Probabilistic Infinite-State Systems

    Author : Sven Sandberg; Parosh Abdulla; Luca de Alfaro; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; program verification; model checking; determinacy; strategy improvement; infinite games; parity games; mean payoff games; stochastic games; Büchi games; reachability games; limiting average; limiting behavior; Markov chains; infinite-state systems; lossy channel systems; vector addition systems; noisy Turing machines; Computer science; Datavetenskap;

    Abstract : Computer programs keep finding their ways into new safety-critical applications, while at the same time growing more complex. This calls for new and better methods to verify the correctness of software. We focus on one approach to verifying systems, namely that of model checking. READ MORE

  2. 2. Optimal stopping, incomplete information, and stochastic games

    Author : Yuqiong Wang; Erik Ekström; Sören Christensen; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Optimal stopping; sequential analysis; incomplete information; asymmetric information; stochastic filtering; Dynkin games; tug-of-war games; Mathematics; Matematik;

    Abstract : This thesis contains six papers on the topics of optimal stopping and stochastic games. Paper I extends the classical Bayesian sequential testing and detection problems for a Brownian motion to higher dimensions. We demonstrate unilateral concavity of the cost function and present its structural properties through various examples. READ MORE

  3. 3. Combinatorial Optimization for Infinite Games on Graphs

    Author : Henrik Björklund; Sergei Vorobyov; Erich Grädel; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; infinite games; combinatorial optimization; randomized algorithms; model checking; strategy evaluation functions; linear programming; iterative improvement; local search; Computer science; Datavetenskap;

    Abstract : Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc. READ MORE

  4. 4. Topics in Mean-Field Control and Games for Pure Jump Processes

    Author : Salah Eddine Choutri; Boualem Djehiche; Marco Fuhrman; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

    Abstract : This thesis is the collection of four papers addressing topics in stochastic optimal control, zero-sum games, backward stochastic differential equations, Pontryagin stochastic maximum principle and relaxed stochastic optimal control.In the first two papers, we establish existence of Markov chains of mean-field type, with countable state space and unbounded jump intensities. READ MORE