Operator approach to stochastic games with varying stage duration
|
|
- Sylvia Berry
- 5 years ago
- Views:
Transcription
1 Operator approach to stochastic games with varying stage duration G.Vigeral (with S. Sorin) CEREMADE Universite Paris Dauphine 4 December 2015, Stochastic methods in Game theory 1 G.Vigeral (with S. Sorin) Operator approach
2 Table of contents 1 Zero-sum stochastic games 2 Exact games with varying stage duration Finite horizon Discounted evaluation 3 Discretization of a continuous timed game 4 Conclusion and remarks 2 G.Vigeral (with S. Sorin) Operator approach
3 Zero-sum stochastic games Table of contents 1 Zero-sum stochastic games 2 Exact games with varying stage duration Finite horizon Discounted evaluation 3 Discretization of a continuous timed game 4 Conclusion and remarks 3 G.Vigeral (with S. Sorin) Operator approach
4 Zero-sum stochastic games Zero-sum stochastic game A zero-sum stochastic game Γ is a 5-tuple (Ω,I,J,g,ρ) where: Ω is the set of states. I (resp. J) is the action set of Player 1 (resp. Player 2). g : I J Ω [ 1,1] is the payoff function (that Player 1 maximizes and Player 2 minimizes). ρ : I J Ω (Ω) is the transition probability. 4 G.Vigeral (with S. Sorin) Operator approach
5 Zero-sum stochastic games How the Game is played An initial state ω 1 is given, known by each player. At each stage k N: the players observe the current state ω k. According to the past history, Player 1 (resp. Player 2) chooses a mixed action x k in X = (I) (resp. y k in Y = (J)). Done independently by each player. An action i k of Player 1 (resp. j k of Player 2) is drawn according to his mixed strategy x k (resp. y k ). This gives the payoff at stage k: g k = g(i k,j k,ω k ). A new state ω k+1 is drawn according to ρ(i k,j k,ω k ). 5 G.Vigeral (with S. Sorin) Operator approach
6 Zero-sum stochastic games The n-stage game For any stochastic game Γ, any finite horizon n N, and any starting state ω 1, the n-stage game Γ n is the zero-sum game with payoff E { n k=1g k } that Player 1 maximizes and Player 2 minimizes. The value of Γ n (ω 1 ) is denoted by V n (ω 1 ). Normalized value v n = V n n., 6 G.Vigeral (with S. Sorin) Operator approach
7 Zero-sum stochastic games The discounted game For any stochastic game Γ, any discount factor λ ]0,1[, and any starting state ω 1, the discounted game Γ λ (ω 1 ) is the zero-sum game with payoff E { + (1 λ) k 1 g k }, k=1 that Player 1 maximizes and Player 2 minimizes. The value of Γ λ (ω 1 ) is denoted by W λ (ω 1 ). Normalized value w λ = λv λ. 7 G.Vigeral (with S. Sorin) Operator approach
8 Zero-sum stochastic games Recursive structure Shapley (1953) proved that the values satisfy a recursive structure: { V n (ω) = sup inf g(x,y,ω) + Eρ(x,y,ω) (V n 1 ( )) } x X y Y = inf sup { g(x,y,ω) + Eρ(x,y,ω) (V n 1 ( )) } y Y x X { W λ (ω) = sup inf g(x,y,ω) + (1 λ)eρ(x,y,ω) (W λ ( )) } x X y Y { = inf g(x,y,ω) + (1 λ)eρ(x,y,ω) (W λ ( )) }. sup y Y x X 8 G.Vigeral (with S. Sorin) Operator approach
9 Zero-sum stochastic games Shapley operator This can be summarized by: V n = Ψ(V n 1 ) = Ψ n (0) W λ = Ψ((1 λ)w λ ) ( 1 λ w λ = λψ λ w λ for some operator Ψ. ) = ( ( )) 1 λ λψ λ { Ψ(f )(ω) = sup inf g(x,y,ω) + Eρ(x,y,ω) (f ( )) } x X y Y { = inf g(x,y,ω) + Eρ(x,y,ω) (f ( )) }. sup y Y x X Ψ is nonexpansive for the infinite norm. Ψ(f ) Ψ(f ) f f 9 G.Vigeral (with S. Sorin) Operator approach
10 Framework Zero-sum stochastic games This was proven by Shapley in the finite case but true in a very wide framework. For example if Ω finite, X and Y compact, g and ρ continuous. Ω, X and Y are compact metric, g and ρ continuous. See Maitra Partasarathy, Nowak, Mertens Sorin Zamir for more general frameworks. 10 G.Vigeral (with S. Sorin) Operator approach
11 Exact games with varying stage duration Table of contents 1 Zero-sum stochastic games 2 Exact games with varying stage duration Finite horizon Discounted evaluation 3 Discretization of a continuous timed game 4 Conclusion and remarks 11 G.Vigeral (with S. Sorin) Operator approach
12 Exact games with varying stage duration Definition Definition due to Neyman (2013). Instead of playing at time 1, 2,, n,, players play at times t 1, t 2,, t n, The intensity of both payoff and transition at time t k is h k = t k+1 t k That is g h = hg and ρ h = (1 h)id + hρ. Shapley operator of "exact game" with duration h : Ψ h = (1 h)id + hψ 12 G.Vigeral (with S. Sorin) Operator approach
13 Exact games with varying stage duration Some natural questions 1 What happens, for a fixed horizon t or discount factor λ, when the duration h i of each stage vanishes? Does the value converge, to which limit? 2 What happens, for a fixed sequence of stage duration h i, when the horizon goes to infinity or the discount factor goes to 0. Does the normalized value converge, to which limit? 3 What happens when both λ (or 1 n ) and h i go to 0? 4 What can be said of optimal strategies in games with varying duration? Neyman answers questions for finite discounted games. Here we use the operator approach to give a general answer to G.Vigeral (with S. Sorin) Operator approach
14 Exact games with varying stage duration Finite horizon Game with finite horizon and varying duration Finite horizon t, finite sequence of stage duration h 1,,h n with h i = t. The value V of such a game satisfies V = z n with z i+1 = Ψ hi (z i ) = (1 h i )z i + h i Ψ(z i ) z i+1 z i h i = (Id Ψ)(z i ) Eulerian scheme associated to f = (Id Ψ)(f ). One can use general results associated to such schemes, for any non expansive operator defined on a Banach space. 14 G.Vigeral (with S. Sorin) Operator approach
15 Exact games with varying stage duration Finite horizon Eulerian schemes in Banach spaces For general nonexpansive Ψ: Proposition (Miyadera-Oharu 70) f nh (z 0 ) Ψ n h (z 0) z 0 Ψ(z 0 ) h n. Proposition (V. 10) If z i+1 = (1 h i )z i + h i Ψ(z i ), then f t (z 0 ) x n z 0 Ψ(z 0 ) n h 2 i. i=1 with t = n i=1 h i. 15 G.Vigeral (with S. Sorin) Operator approach
16 Exact games with varying stage duration Result with t fixed Finite horizon Let h = maxh i and t = h i, then V f (t) K ht. Hence as the mesh h goes to 0, the value of the game goes to f (t). f (t) can be interpreted as the value of a game played in continuous time (Neyman 13). 16 G.Vigeral (with S. Sorin) Operator approach
17 Exact games with varying stage duration Asymptotic results Finite horizon For any h i, V f (t) K. t t All the repeated games with varying stage duration have the same (normalized) asymptotic behavior. Same asymptotic behavior for the normalized value in continuous time f (t) t and for the normalized value of the original game v n. 17 G.Vigeral (with S. Sorin) Operator approach
18 Exact games with varying stage duration Discounted evaluation Game with discount factor and varying duration Discount factor λ = weight on the payoff on [0,1] compared to [0,+ ]. Infinite sequence of stage durations h 1,,h n,. ( When h is constant, normalized value w h λ = λψ 1 λh h λ In general w is ( ) + with D h i λ i=1 D h λ (f ) = λψ h (0) ( 1 λh λ ) f. ). 18 G.Vigeral (with S. Sorin) Operator approach
19 Exact games with varying stage duration Discounted evaluation Result with λ fixed and vanishing duration For a uniform duration h, w h λ = w µ with µ = λ 1+λ λh. For any λ and h i h, the value w of the λ discounted game with stage durations h i satisfies w ŵ λ Kh with ŵ λ := w λ. 1+λ Hence as the mesh h goes to 0, the value of the game goes to w λ. Already known when the game is finite 1+λ (Neyman 2013). ŵ λ can be interpreted as the value of a game played in continuous time (Neyman 13). 19 G.Vigeral (with S. Sorin) Operator approach
20 Exact games with varying stage duration Asymptotic results Discounted evaluation Assumption: there exists nondecreasing k :]0,1] R + and l : [0,+ ] R + with k(λ) = o( λ) as λ goes to 0 and D 1 λ (z) D1 µ(z) k( λ µ )l( z ) for all (λ,µ) ]0,1] 2 and z Z. Always true for Shapley operators of games with bounded payoff. Then for any λ and h i, the value w of the λ discounted game with stage durations h i satisfies w w λ Kλ. All the repeated games with varying stage duration have the same (normalized) asymptotic behavior as λ goes to 0. Same asymptotic behavior for the normalized value in continuous time ŵ λ and for the normalized value of the original game w λ. 20 G.Vigeral (with S. Sorin) Operator approach
21 Discretization of a continuous timed game Table of contents 1 Zero-sum stochastic games 2 Exact games with varying stage duration Finite horizon Discounted evaluation 3 Discretization of a continuous timed game 4 Conclusion and remarks 21 G.Vigeral (with S. Sorin) Operator approach
22 Model Discretization of a continuous timed game Finite state space. P t (i,j) is a continuous time homogeneous Markov chain on Ω, indexed by R +, with generator Q(i,j): Ṗ t (i,j) = P t (i,j)q(i,j). G h is the discretization with mesh h of the game in continuous time G where the state variable follows P t and is controlled by both players (Zachrisson 64, Tanaka Wakuta 77, Guo Hernadez-Lerma 03, Neyman 12) Players act at time s = kh by choosing actions (i s,j s ) (at random according to some x s, resp. y s ), knowing the current state. Between time s and s + h, state ω t evolves with conditional law P t 22 G.Vigeral (with S. Sorin) Operator approach
23 Discretization of a continuous timed game Results Shapley operator is Ψ h (f ) = val X Y {gh + P h f } where g h (ω 0,x,y) stands for E[ h 0 g(ω t;x,y)dt] and P h (x,y) = I J Ph (i,j)x(di)y(dj). Ψ h (f ) Ψ h (f ) = (1 + f )O(h 2 ) where Ψ is the Shapley operator of the (discrete time) stochastic game with payoff g and transition Id + Q. Hence all the results of previous section involving small h still hold. 23 G.Vigeral (with S. Sorin) Operator approach
24 Conclusion and remarks Table of contents 1 Zero-sum stochastic games 2 Exact games with varying stage duration Finite horizon Discounted evaluation 3 Discretization of a continuous timed game 4 Conclusion and remarks 24 G.Vigeral (with S. Sorin) Operator approach
25 Conclusion Conclusion and remarks We recover and generalize some results of Neyman 13, using only properties of nonexpansive operators. Only assumptions are : a) Ψ is well defined and 1-Lipschitz b) the current state is observed. Same asymptotic structure of original game, games with varying duration, and game in continuous time. Counterexamples of convergence of values with observations of states (V., Ziliotto, Sorin V.) are thus also oscillating with varying duration. 25 G.Vigeral (with S. Sorin) Operator approach
26 Conclusion and remarks Open questions What happens with a general weight on the payoff (not finite horizon or constant discount factor)? When h goes to 0, results by Neyman (finite games) and Sorin (using viscosity techniques). What happens when all the weight goes to infinity (analogous to t goes to infinity or λ to 0). What if the state is not observed? 26 G.Vigeral (with S. Sorin) Operator approach
27 A stupid game Conclusion and remarks S C 0 1 ω ω C S Only one player He observes (and remember) his moves but not the state. Starting state ω. Clearly w λ tends to 1 as λ goes to 0 27 G.Vigeral (with S. Sorin) Operator approach
28 Conclusion and remarks A (not so) stupid game with varying stage duration. C S 0 1 ω ω C S As long as Player 1 plays change the probability of being in the first state satisfies p t+1 = (1 h)p t + h(1 p t ) = (1 2h)p t + h. Hence h 1 2, wh λ tends to 1 2 as λ goes to 0. In fact wh λ 1 2 for any h G.Vigeral (with S. Sorin) Operator approach
29 Conclusion and remarks Thank you for your attention Thank you! 29 G.Vigeral (with S. Sorin) Operator approach
Limit value of dynamic zero-sum games with vanishing stage duration
Limit value of dynamic zero-sum games with vanishing stage duration Sylvain Sorin IMJ-PRG Université P. et M. Curie - Paris 6 sylvain.sorin@imj-prg.fr Workshop on Analysis and Applications of Stochastic
More informationLimit value of dynamic zero-sum games with vanishing stage duration
Limit value of dynamic zero-sum games with vanishing stage duration Sylvain Sorin IMJ-PRG Université P. et M. Curie - Paris 6 sylvain.sorin@imj-prg.fr Stochastic Methods in Game Theory National University
More informationREVERSIBILITY AND OSCILLATIONS IN ZERO-SUM DISCOUNTED STOCHASTIC GAMES
REVERSIBILITY AND OSCILLATIONS IN ZERO-SUM DISCOUNTED STOCHASTIC GAMES Sylvain Sorin, Guillaume Vigeral To cite this version: Sylvain Sorin, Guillaume Vigeral. REVERSIBILITY AND OSCILLATIONS IN ZERO-SUM
More informationLimit Value of Dynamic Zero-Sum Games with Vanishing Stage Duration
http://pubsonline.informs.org/journal/moor/ MATHEMATICS OF OPERATIONS RESEARCH Articles in Advance, pp. 1 13 ISSN 0364-765X (print), ISSN 1526-5471 (online) Limit Value of Dynamic Zero-Sum Games with Vanishing
More informationThe Folk Theorem for Finitely Repeated Games with Mixed Strategies
The Folk Theorem for Finitely Repeated Games with Mixed Strategies Olivier Gossner February 1994 Revised Version Abstract This paper proves a Folk Theorem for finitely repeated games with mixed strategies.
More informationNew Approaches and Recent Advances in Two-Person Zero-Sum Repeated Games
New Approaches and Recent Advances in Two-Person Zero-Sum Repeated Games Sylvain Sorin Laboratoire d Econométrie Ecole Polytechnique 1 rue Descartes 75005 Paris, France and Equipe Combinatoire et Optimisation
More informationAcyclic Gambling Games
1/19 Rida Laraki and Jérôme Renault CNRS & Univ. Paris Dauphine, Toulouse School of Economics Univ. Toulouse 1 Stochastic Games, Singapore, December 4, 2015 Introduction Zero-sum stochastic games where
More informationarxiv: v2 [math.oc] 14 Nov 2013
Definable zero-sum stochastic games Jérôme BOLTE, Stéphane GAUBERT & Guillaume VIGERAL November 5, 2018 arxiv:1301.1967v2 [math.oc] 14 Nov 2013 Abstract Definable zero-sum stochastic games involve a finite
More informationZero-sum Stochastic Games
Stochastic Methods in Game Theory Jérôme Renault Institute of Mathematical Sciences, Singapour November 2015 Zero-sum Stochastic Games Theses notes, to be partially covered during the tutorial, concern
More informationAbstract. This chapter deals with stochastic games where the state is not publicly known.
STOCHASTIC GAMES WITH INCOMPLETE INFORMATION SYLVAIN SORIN Université P. et M. Curie and École Polytechnique Paris, France Abstract. This chapter deals with stochastic games where the state is not publicly
More informationAsymptotic value in frequency-dependent games: A differential approach
Asymptotic value in frequency-dependent games: A differential approach Joseph Abdou, ikolaos Pnevmatikos To cite this version: Joseph Abdou, ikolaos Pnevmatikos. Asymptotic value in frequency-dependent
More informationAcyclic Gambling Games
Acyclic Gambling Games Rida Laraki. and Jérôme Renault April 24, 2018 Abstract We consider 2-player zero-sum stochastic games where each player controls his own state variable living in a compact metric
More informationZero-sum Stochastic Games
1/53 Jérôme Renault, TSE Université Toulouse Stochastic Methods in Game Theory, Singapore 2015 2/53 Outline Zero-sum stochastic games 1. The basic model: finitely many states and actions 1.1 Description
More informationGame Theory and its Applications to Networks - Part I: Strict Competition
Game Theory and its Applications to Networks - Part I: Strict Competition Corinne Touati Master ENS Lyon, Fall 200 What is Game Theory and what is it for? Definition (Roger Myerson, Game Theory, Analysis
More informationarxiv: v1 [math.oc] 19 Jan 2019
Asymptotic value in frequency-dependent games with separable payoffs: a differential approach. Joseph M. Abdou, ikolaos Pnevmatikos January 23, 2019 arxiv:1901.06522v1 [math.oc] 19 Jan 2019 Abstract We
More informationNoncooperative continuous-time Markov games
Morfismos, Vol. 9, No. 1, 2005, pp. 39 54 Noncooperative continuous-time Markov games Héctor Jasso-Fuentes Abstract This work concerns noncooperative continuous-time Markov games with Polish state and
More informationOn a mean value property related to the p-laplacian and p-harmonious functions
On a mean value property related to the p-laplacian and p-harmonious functions Ángel Arroyo García Universitat Autònoma de Barcelona Workshop on Complex Analysis and Operator Theory Málaga, June 23, 2016
More informationTwo-player games : a reduction
Two-player games : a reduction Nicolas Vieille December 12, 2001 The goal of this chapter, together with the next one, is to give a detailed overview of the proof of the following result. Theorem 1 Let
More informationRome - May 12th Université Paris-Diderot - Laboratoire Jacques-Louis Lions. Mean field games equations with quadratic
Université Paris-Diderot - Laboratoire Jacques-Louis Lions Rome - May 12th 2011 Hamiltonian MFG Hamiltonian on the domain [0, T ] Ω, Ω standing for (0, 1) d : (HJB) (K) t u + σ2 2 u + 1 2 u 2 = f (x, m)
More informationLecture notes for Analysis of Algorithms : Markov decision processes
Lecture notes for Analysis of Algorithms : Markov decision processes Lecturer: Thomas Dueholm Hansen June 6, 013 Abstract We give an introduction to infinite-horizon Markov decision processes (MDPs) with
More informationComputing Uniformly Optimal Strategies in Two-Player Stochastic Games
Noname manuscript No. will be inserted by the editor) Computing Uniformly Optimal Strategies in Two-Player Stochastic Games Eilon Solan and Nicolas Vieille Received: date / Accepted: date Abstract We provide
More informationZero-sum semi-markov games in Borel spaces: discounted and average payoff
Zero-sum semi-markov games in Borel spaces: discounted and average payoff Fernando Luque-Vásquez Departamento de Matemáticas Universidad de Sonora México May 2002 Abstract We study two-person zero-sum
More informationQuitting games - An Example
Quitting games - An Example E. Solan 1 and N. Vieille 2 January 22, 2001 Abstract Quitting games are n-player sequential games in which, at any stage, each player has the choice between continuing and
More informationMarkov Decision Processes and Dynamic Programming
Markov Decision Processes and Dynamic Programming A. LAZARIC (SequeL Team @INRIA-Lille) Ecole Centrale - Option DAD SequeL INRIA Lille EC-RL Course In This Lecture A. LAZARIC Markov Decision Processes
More informationSubgame-Perfect Equilibria for Stochastic Games
MATHEMATICS OF OPERATIONS RESEARCH Vol. 32, No. 3, August 2007, pp. 711 722 issn 0364-765X eissn 1526-5471 07 3203 0711 informs doi 10.1287/moor.1070.0264 2007 INFORMS Subgame-Perfect Equilibria for Stochastic
More informationTHE BIG MATCH WITH A CLOCK AND A BIT OF MEMORY
THE BIG MATCH WITH A CLOCK AND A BIT OF MEMORY KRISTOFFER ARNSFELT HANSEN, RASMUS IBSEN-JENSEN, AND ABRAHAM NEYMAN Abstract. The Big Match is a multi-stage two-player game. In each stage Player hides one
More informationSubgame-Perfection in Quitting Games with Perfect Information and Differential Equations
Subgame-Perfection in Quitting Games with Perfect Information and Differential Equations Eilon Solan September 3, 2002 Abstract We introduce a new approach to study subgame-perfect equilibrium payoffs
More informationThermodynamic limit for a system of interacting fermions in a random medium. Pieces one-dimensional model
Thermodynamic limit for a system of interacting fermions in a random medium. Pieces one-dimensional model Nikolaj Veniaminov (in collaboration with Frédéric Klopp) CEREMADE, University of Paris IX Dauphine
More informationThe Complexity of Ergodic Mean-payoff Games,
The Complexity of Ergodic Mean-payoff Games, Krishnendu Chatterjee Rasmus Ibsen-Jensen Abstract We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the
More informationRamsey determinacy of adversarial Gowers games
Université Paris VII, IMJ-PRG Descriptive set theory in Paris December 8, 2015 Gower s theorems Theorem (Gowers first dichotomy, 1996) Every infinite-dimensional Banach space has an infinite-dimensional
More informationPairwise Comparison Dynamics for Games with Continuous Strategy Space
Pairwise Comparison Dynamics for Games with Continuous Strategy Space Man-Wah Cheung https://sites.google.com/site/jennymwcheung University of Wisconsin Madison Department of Economics Nov 5, 2013 Evolutionary
More informationSome SDEs with distributional drift Part I : General calculus. Flandoli, Franco; Russo, Francesco; Wolf, Jochen
Title Author(s) Some SDEs with distributional drift Part I : General calculus Flandoli, Franco; Russo, Francesco; Wolf, Jochen Citation Osaka Journal of Mathematics. 4() P.493-P.54 Issue Date 3-6 Text
More informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationOn the infinity Laplace operator
On the infinity Laplace operator Petri Juutinen Köln, July 2008 The infinity Laplace equation Gunnar Aronsson (1960 s): variational problems of the form S(u, Ω) = ess sup H (x, u(x), Du(x)). (1) x Ω The
More informationThe Value of Information in Zero-Sum Games
The Value of Information in Zero-Sum Games Olivier Gossner THEMA, Université Paris Nanterre and CORE, Université Catholique de Louvain joint work with Jean-François Mertens July 2001 Abstract: It is not
More informationNear-Potential Games: Geometry and Dynamics
Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo January 29, 2012 Abstract Potential games are a special class of games for which many adaptive user dynamics
More informationDynamic Games with General Time Preferences
Dynamic Games with General Time Preferences Ichiro Obara Jaeok Park UCLA Yonsei University November 21, 2014 Obara and Park (UCLA and Yonsei) Dynamic Games with General Time Preferences November 21, 2014
More informationDifferential Games II. Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011
Differential Games II Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011 Contents 1. I Introduction: A Pursuit Game and Isaacs Theory 2. II Strategies 3.
More informationInverse function theorems
Inverse function theorems Ivar Ekeland CEREMADE, Université Paris-Dauphine Ravello, May 2011 Ivar Ekeland (CEREMADE, Université Paris-Dauphine) Inverse function theorems Ravello, May 2011 1 / 18 Ekeland
More informationAsymptotics of minimax stochastic programs
Asymptotics of minimax stochastic programs Alexander Shapiro Abstract. We discuss in this paper asymptotics of the sample average approximation (SAA) of the optimal value of a minimax stochastic programming
More informationRegularity for functionals involving perimeter
Regularity for functionals involving perimeter Guido De Philippis, Jimmy Lamboley, Michel Pierre, Bozhidar Velichkov Université Paris Dauphine, CEREMADE 22/11/16, CIRM Shape optimization, Isoperimetric
More informationThe Index of Nash Equilibria
Equilibria in Games, Santiago, Chile January 10, 2017 Finite Normal-Form Games We consider in these lectures, the set of finite games with fixed strategy sets and parametrized by the payoff functions.
More informationReductions Of Undiscounted Markov Decision Processes and Stochastic Games To Discounted Ones. Jefferson Huang
Reductions Of Undiscounted Markov Decision Processes and Stochastic Games To Discounted Ones Jefferson Huang School of Operations Research and Information Engineering Cornell University November 16, 2016
More informationTUG OF WAR INFINITY LAPLACIAN
TUG OF WAR and the INFINITY LAPLACIAN How to solve degenerate elliptic PDEs and the optimal Lipschitz extension problem by playing games. Yuval Peres, Oded Schramm, Scott Sheffield, and David Wilson Infinity
More informationSMSTC (2007/08) Probability.
SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................
More informationAsymmetric Information Security Games 1/43
Asymmetric Information Security Games Jeff S. Shamma with Lichun Li & Malachi Jones & IPAM Graduate Summer School Games and Contracts for Cyber-Physical Security 7 23 July 2015 Jeff S. Shamma Asymmetric
More informationŁukasz Kaiser Joint work with Diana Fischer and Erich Grädel
Quantitative Systems, Modal Logics and Games Łukasz Kaiser Joint work with Diana Fischer and Erich Grädel Mathematische Grundlagen der Informatik RWTH Aachen AlgoSyn, February 28 Quantitative Systems (Łukasz
More informationChapter 2 SOME ANALYTICAL TOOLS USED IN THE THESIS
Chapter 2 SOME ANALYTICAL TOOLS USED IN THE THESIS 63 2.1 Introduction In this chapter we describe the analytical tools used in this thesis. They are Markov Decision Processes(MDP), Markov Renewal process
More informationWHY SATURATED PROBABILITY SPACES ARE NECESSARY
WHY SATURATED PROBABILITY SPACES ARE NECESSARY H. JEROME KEISLER AND YENENG SUN Abstract. An atomless probability space (Ω, A, P ) is said to have the saturation property for a probability measure µ on
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationZero-Sum Average Semi-Markov Games: Fixed Point Solutions of the Shapley Equation
Zero-Sum Average Semi-Markov Games: Fixed Point Solutions of the Shapley Equation Oscar Vega-Amaya Departamento de Matemáticas Universidad de Sonora May 2002 Abstract This paper deals with zero-sum average
More informationStochastic Dynamic Programming: The One Sector Growth Model
Stochastic Dynamic Programming: The One Sector Growth Model Esteban Rossi-Hansberg Princeton University March 26, 2012 Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, 2012 1 / 31 References
More informationExponential Moving Average Based Multiagent Reinforcement Learning Algorithms
Exponential Moving Average Based Multiagent Reinforcement Learning Algorithms Mostafa D. Awheda Department of Systems and Computer Engineering Carleton University Ottawa, Canada KS 5B6 Email: mawheda@sce.carleton.ca
More informationMyopic Models of Population Dynamics on Infinite Networks
Myopic Models of Population Dynamics on Infinite Networks Robert Carlson Department of Mathematics University of Colorado at Colorado Springs rcarlson@uccs.edu June 30, 2014 Outline Reaction-diffusion
More informationViscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces
Viscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces YUAN-HENG WANG Zhejiang Normal University Department of Mathematics Yingbing Road 688, 321004 Jinhua
More informationConstructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space
Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space Yasuhito Tanaka, Member, IAENG, Abstract In this paper we constructively
More informationRegular finite Markov chains with interval probabilities
5th International Symposium on Imprecise Probability: Theories and Applications, Prague, Czech Republic, 2007 Regular finite Markov chains with interval probabilities Damjan Škulj Faculty of Social Sciences
More informationHidden Stochastic Games and Limit Equilibrium Payoffs
Hidden Stochastic Games and Limit Equilibrium Payoffs arxiv:1407.3028v2 [math.oc] 10 Dec 2014 Jérôme Renault, Bruno Ziliotto September 17, 2018 Abstract We consider 2-player stochastic games with perfectly
More informationMean-field dual of cooperative reproduction
The mean-field dual of systems with cooperative reproduction joint with Tibor Mach (Prague) A. Sturm (Göttingen) Friday, July 6th, 2018 Poisson construction of Markov processes Let (X t ) t 0 be a continuous-time
More informationMinimal time mean field games
based on joint works with Samer Dweik and Filippo Santambrogio PGMO Days 2017 Session Mean Field Games and applications EDF Lab Paris-Saclay November 14th, 2017 LMO, Université Paris-Sud Université Paris-Saclay
More informationMulti-dimensional Stochastic Singular Control Via Dynkin Game and Dirichlet Form
Multi-dimensional Stochastic Singular Control Via Dynkin Game and Dirichlet Form Yipeng Yang * Under the supervision of Dr. Michael Taksar Department of Mathematics University of Missouri-Columbia Oct
More informationMean-field equilibrium: An approximation approach for large dynamic games
Mean-field equilibrium: An approximation approach for large dynamic games Ramesh Johari Stanford University Sachin Adlakha, Gabriel Y. Weintraub, Andrea Goldsmith Single agent dynamic control Two agents:
More informationStochastic Shortest Path Problems
Chapter 8 Stochastic Shortest Path Problems 1 In this chapter, we study a stochastic version of the shortest path problem of chapter 2, where only probabilities of transitions along different arcs can
More informationThe Structure of Non-zero-sum Stochastic Games
The Structure of Non-zero-sum Stochastic Games Robert Samuel Simon 7 December 2005 CDAM Research Report LSE-CDAM-2005-19 London School of Economics Department of Mathematics Houghton Street London WC2A
More informationOptimal exit strategies for investment projects. 7th AMaMeF and Swissquote Conference
Optimal exit strategies for investment projects Simone Scotti Université Paris Diderot Laboratoire de Probabilité et Modèles Aléatories Joint work with : Etienne Chevalier, Université d Evry Vathana Ly
More informationPoint Process Control
Point Process Control The following note is based on Chapters I, II and VII in Brémaud s book Point Processes and Queues (1981). 1 Basic Definitions Consider some probability space (Ω, F, P). A real-valued
More informationSome notes on Markov Decision Theory
Some notes on Markov Decision Theory Nikolaos Laoutaris laoutaris@di.uoa.gr January, 2004 1 Markov Decision Theory[1, 2, 3, 4] provides a methodology for the analysis of probabilistic sequential decision
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationRolle s Theorem for Polynomials of Degree Four in a Hilbert Space 1
Journal of Mathematical Analysis and Applications 265, 322 33 (2002) doi:0.006/jmaa.200.7708, available online at http://www.idealibrary.com on Rolle s Theorem for Polynomials of Degree Four in a Hilbert
More informationAbstract Dynamic Programming
Abstract Dynamic Programming Dimitri P. Bertsekas Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Overview of the Research Monograph Abstract Dynamic Programming"
More informationBefore you begin read these instructions carefully.
MATHEMATICAL TRIPOS Part IB Thursday, 6 June, 2013 9:00 am to 12:00 pm PAPER 3 Before you begin read these instructions carefully. Each question in Section II carries twice the number of marks of each
More informationSELECTION THEOREMS FOR MULTIFUNCTIONS IN PARTIALLY ORDERED SETS
SELECTION THEOREMS FOR MULTIFUNCTIONS IN PARTIALLY ORDERED SETS M. A. KHAMSI Abstract. It is shown that an order preserving multivalued mapping T of a complete lattice X which takes values in the space
More informationThe Small Progress Measures algorithm for Parity games
The Small Progress Measures algorithm for Parity games Material: Small Progress Measures for Solving Parity Games, Marcin Jurdziński Jeroen J.A. Keiren jkeiren@win.tue.nl http://www.win.tue.nl/ jkeiren
More informationStochastic Homogenization for Reaction-Diffusion Equations
Stochastic Homogenization for Reaction-Diffusion Equations Jessica Lin McGill University Joint Work with Andrej Zlatoš June 18, 2018 Motivation: Forest Fires ç ç ç ç ç ç ç ç ç ç Motivation: Forest Fires
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More information1.1. The category of Banach spaces. A Banach space E over F is a complete normed vector space where F = R or C. This means that
BANACH CALCULUS CHIN-LUNG WANG Abstract. This is part of my lecture notes for Honored Advanced Calculus at National Taiwan University in 211-212. We prove the inverse function theorem for Banach spaces
More informationPatrizio Frosini. Department of Mathematics and ARCES, University of Bologna
An observer-oriented approach to topological data analysis Part 2: The algebra of group invariant non-expansive operators and its application in the project GIPHOD - Group Invariant Persistent Homology
More informationAn Introduction to Noncooperative Games
An Introduction to Noncooperative Games Alberto Bressan Department of Mathematics, Penn State University Alberto Bressan (Penn State) Noncooperative Games 1 / 29 introduction to non-cooperative games:
More informationMarkov Decision Processes and Dynamic Programming
Master MVA: Reinforcement Learning Lecture: 2 Markov Decision Processes and Dnamic Programming Lecturer: Alessandro Lazaric http://researchers.lille.inria.fr/ lazaric/webpage/teaching.html Objectives of
More informationA FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS
Fixed Point Theory, (0), No., 4-46 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html A FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS A. ABKAR AND M. ESLAMIAN Department of Mathematics,
More informationMarkov decision processes and interval Markov chains: exploiting the connection
Markov decision processes and interval Markov chains: exploiting the connection Mingmei Teo Supervisors: Prof. Nigel Bean, Dr Joshua Ross University of Adelaide July 10, 2013 Intervals and interval arithmetic
More informationAPPLICATIONS IN FIXED POINT THEORY. Matthew Ray Farmer. Thesis Prepared for the Degree of MASTER OF ARTS UNIVERSITY OF NORTH TEXAS.
APPLICATIONS IN FIXED POINT THEORY Matthew Ray Farmer Thesis Prepared for the Degree of MASTER OF ARTS UNIVERSITY OF NORTH TEXAS December 2005 APPROVED: Elizabeth M. Bator, Major Professor Paul Lewis,
More informationInvariant measures and the soliton resolution conjecture
Invariant measures and the soliton resolution conjecture Stanford University The focusing nonlinear Schrödinger equation A complex-valued function u of two variables x and t, where x R d is the space variable
More informationMarkov Processes Hamid R. Rabiee
Markov Processes Hamid R. Rabiee Overview Markov Property Markov Chains Definition Stationary Property Paths in Markov Chains Classification of States Steady States in MCs. 2 Markov Property A discrete
More informationMarkov Decision Processes and Dynamic Programming
Markov Decision Processes and Dynamic Programming A. LAZARIC (SequeL Team @INRIA-Lille) ENS Cachan - Master 2 MVA SequeL INRIA Lille MVA-RL Course How to model an RL problem The Markov Decision Process
More informationVARIATIONAL PRINCIPLE FOR THE ENTROPY
VARIATIONAL PRINCIPLE FOR THE ENTROPY LUCIAN RADU. Metric entropy Let (X, B, µ a measure space and I a countable family of indices. Definition. We say that ξ = {C i : i I} B is a measurable partition if:
More informationNash Equilibrium for Upward-Closed Objectives Krishnendu Chatterjee Report No. UCB/CSD August 2005 Computer Science Division (EECS) University
Nash Equilibrium for Upward-Closed Objectives Krishnendu Chatterjee Report No. UCB/CSD-5-1407 August 2005 Computer Science Division (EECS) University of California Berkeley, California 94720 Nash Equilibrium
More informationAsymptotic distribution of eigenvalues of Laplace operator
Asymptotic distribution of eigenvalues of Laplace operator 23.8.2013 Topics We will talk about: the number of eigenvalues of Laplace operator smaller than some λ as a function of λ asymptotic behaviour
More informationA Mean Field Approach for Optimization in Discrete Time
oname manuscript o. will be inserted by the editor A Mean Field Approach for Optimization in Discrete Time icolas Gast Bruno Gaujal the date of receipt and acceptance should be inserted later Abstract
More informationValue Iteration and Action ɛ-approximation of Optimal Policies in Discounted Markov Decision Processes
Value Iteration and Action ɛ-approximation of Optimal Policies in Discounted Markov Decision Processes RAÚL MONTES-DE-OCA Departamento de Matemáticas Universidad Autónoma Metropolitana-Iztapalapa San Rafael
More informationON THE POLICY IMPROVEMENT ALGORITHM IN CONTINUOUS TIME
ON THE POLICY IMPROVEMENT ALGORITHM IN CONTINUOUS TIME SAUL D. JACKA AND ALEKSANDAR MIJATOVIĆ Abstract. We develop a general approach to the Policy Improvement Algorithm (PIA) for stochastic control problems
More informationA Concise Course on Stochastic Partial Differential Equations
A Concise Course on Stochastic Partial Differential Equations Michael Röckner Reference: C. Prevot, M. Röckner: Springer LN in Math. 1905, Berlin (2007) And see the references therein for the original
More information(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);
STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend
More informationRetrospective Spectrum Access Protocol: A Completely Uncoupled Learning Algorithm for Cognitive Networks
Retrospective Spectrum Access Protocol: A Completely Uncoupled Learning Algorithm for Cognitive Networks Marceau Coupechoux, Stefano Iellamo, Lin Chen + TELECOM ParisTech (INFRES/RMS) and CNRS LTCI + University
More informationSeparable and Low-Rank Continuous Games
LIDS Technical Report 2760 1 Separable and Low-Rank Continuous Games Noah D. Stein, Asuman Ozdaglar, and Pablo A. Parrilo July 23, 2007 Abstract In this paper, we study nonzero-sum separable games, which
More informationMATH 56A SPRING 2008 STOCHASTIC PROCESSES
MATH 56A SPRING 008 STOCHASTIC PROCESSES KIYOSHI IGUSA Contents 4. Optimal Stopping Time 95 4.1. Definitions 95 4.. The basic problem 95 4.3. Solutions to basic problem 97 4.4. Cost functions 101 4.5.
More informationSEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE
SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE FRANÇOIS BOLLEY Abstract. In this note we prove in an elementary way that the Wasserstein distances, which play a basic role in optimal transportation
More informationProcedures we can use to resolve disagreements
February 15th, 2012 Motivation for project What mechanisms could two parties use to resolve disagreements? Default position d = (0, 0) if no agreement reached Offers can be made from a feasible set V Bargaining
More informationRECURSION EQUATION FOR
Math 46 Lecture 8 Infinite Horizon discounted reward problem From the last lecture: The value function of policy u for the infinite horizon problem with discount factor a and initial state i is W i, u
More information