Bounding Fixed Points of Set-Based Bellman Operator and Nash Equilibria of Stochastic Games

01/22/2020
by   Sarah H. Q. Li, et al.
0

Motivated by uncertain parameters encountered in Markov decision processes (MDPs) and stochastic games, we study the effect of parameter uncertainty on Bellman operator-based algorithms under a set-based framework. Specifically, we first consider a family of MDPs where the cost parameters are in a given compact set; we then define a Bellman operator acting on a set of value functions to produce a new set of value functions as the output under all possible variations in the cost parameter. We prove the existence of a fixed point of this set-based Bellman operator by showing that it is contractive on a complete metric space, and explore its relationship with the corresponding family of MDPs and stochastic games. Additionally, we show that given interval set bounded cost parameters, we can form exact bounds on the set of optimal value functions. Finally, we utilize our results to bound the value function trajectory of a player in a stochastic game.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2020

Fixed Points of the Set-Based Bellman Operator

Motivated by uncertain parameters encountered in Markov decision process...
research
07/15/2022

Set-based value operators for non-stationary Markovian environments

This paper analyzes finite state Markov Decision Processes (MDPs) with u...
research
01/16/2013

Fast Planning in Stochastic Games

Stochastic games generalize Markov decision processes (MDPs) to a multia...
research
02/25/2022

Stochastic Games with Synchronizing Objectives

We consider two-player stochastic games played on a finite graph for inf...
research
01/30/2022

The Geometry of Robust Value Functions

The space of value functions is a fundamental concept in reinforcement l...
research
04/19/2018

Algorithms and Conditional Lower Bounds for Planning Problems

We consider planning problems for graphs, Markov decision processes (MDP...
research
09/07/2019

Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria

The use of monotonicity and Tarski's theorem in existence proofs of equi...

Please sign up or login with your details

Forgot password? Click here to reset