The operator approach to entropy games
From MaRDI portal
Publication:2321934
DOI10.1007/s00224-019-09925-zzbMath1422.91080OpenAlexW2963058159WikidataQ127769645 ScholiaQ127769645MaRDI QIDQ2321934
Jérémie Guillaud, Marianne Akian, Stéphane Gaubert, Julien Grand-Clément
Publication date: 27 August 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7026/
Probability distributions: general theory (60E05) 2-person games (91A05) Stochastic games, stochastic differential games (91A15) Miscellaneous applications of operator theory (47N99)
Related Items (5)
A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices ⋮ A Convex Programming Approach to Solve Posynomial Systems ⋮ The greedy strategy for optimizing the Perron eigenvalue ⋮ Maximal Acyclic Subgraphs and Closest Stable Matrices ⋮ Spectral inequalities for nonnegative tensors and their tropical analogues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral simplex method
- A zero-sum stochastic game with compact action sets and no asymptotic value
- A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
- Hourglass alternative and the finiteness conjecture for the spectral characteristics of sets of non-negative matrices
- Convexity and log convexity for the spectral radius
- Asymptotic expansions for dynamic programming recursions with general nonnegative matrices
- The ellipsoid method and its consequences in combinatorial optimization
- Denjoy-Wolff theorems for Hilbert's and Thompson's metric spaces
- TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES
- The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
- On the complexity of computing maximum entropy for Markovian Models
- A maximin characterisation of the escape rate of non-expansive mappings in metrically convex spaces
- A CONVEXITY PROPERTY OF POSITIVE MATRICES
- Multiplicative Markov Decision Chains
- Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
- The Complexity of Solving Stochastic Games on Graphs
- Some Relations Between Nonexpansive and Order Preserving Mappings
- Fixed Points and Iteration of a Nonexpansive Mapping in a Banach Space
- On a Variational Formula for the Principal Eigenvalue for Operators with Maximum Principle
- The Asymptotic Theory of Stochastic Games
- Polynomial Minimum Root Separation
- On the Complexity of Familiar Functions and Numbers
- Risk-Sensitive Control of Finite State Machines on an Infinite Horizon II
- Variational Analysis
- Risk-Sensitive Control of Finite State Machines on an Infinite Horizon I
- Entropy Games and Matrix Multiplication Games
- The operator approach to entropy games
- The Perron-Frobenius theorem for homogeneous, monotone functions
- Definable Zero-Sum Stochastic Games
- Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
- On Nonterminating Stochastic Games
- Risk-Sensitive Markov Decision Processes
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- A Variational Formula for Risk-Sensitive Reward
- Mean Value Methods in Iteration
- Stochastic games
This page was built for publication: The operator approach to entropy games