Randomized sampling for large zero-sum games

DOI10.1016/j.automatica.2013.01.062zbMath1319.91012OpenAlexW2139397712MaRDI QIDQ490542

Shaunak D. Bopardikar, João P. Hespanha, Maria Prandini, Alessandro Borri, Maria Domenica Di Benedetto

Publication date: 27 August 2015

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.01.062

zbMATH Keywords

optimizationgame theoryzero-sum gamesrandomized algorithms

Mathematics Subject Classification ID

2-person games (91A05) Randomized algorithms (68W20) Probabilistic games; gambling (91A60)

Related Items (3)

On incremental approximate saddle-point computation in zero-sum matrix games ⋮ Performance assessment and design of abstracted models for stochastic hybrid systems through a randomized approach ⋮ Randomized sampling for large zero-sum games

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized sampling for large zero-sum games
• On the expected probability of constraint violation in sampled convex programs
• Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
• Ambiguous chance constrained problems and robust optimization
• Simple strategies for large zero-sum games with applications to complexity theory
• Random Convex Programs
• Dynamic Programming Treatment of the Travelling Salesman Problem
• The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
• Notes on the Scenario Design Approach
• Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
• Probabilistic Robust Controller Design: Probable Near Minimax Value and Randomized Algorithms
• The Scenario Approach to Robust Control Design
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Probabilistic solutions to some NP-hard matrix problems

This page was built for publication: Randomized sampling for large zero-sum games