Randomized sampling for large zero-sum games
Shaunak D. Bopardikar,Alessandro Borri,Joao P. Hespanha,Maria Prandini,Maria Domenica Di Benedetto +4 more
25
TL;DR: This paper formalizes a procedure, termed as the sampled security policy (SSP) algorithm, by which a player can compute policies that, with a high confidence, are security policies against an adversary using randomized methods to explore the possible outcomes of the game.
read more
About: This article is published in Automatica. The article was published on 01 May 2013. and is currently open access. The article focuses on the topics: Randomized algorithm & Outcome (game theory).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On the sample size of random convex programs with structured dependence on the uncertainty
TL;DR: In this paper, the authors derived improved bounds of Helly's dimension for problems where the chance constraint has certain structural properties, leading both to improved objective value and reduced computational complexity, which is applicable to Randomized Model Predictive Control of chance constrained linear systems with additive uncertainty and affine disturbance feedback.
PEAS: A Performance Evaluation Framework for Auto-Scaling Strategies in Cloud Applications
Alessandro Vittorio Papadopoulos,Ahmed Ali-Eldin,Karl-Erik Årzén,Johan Tordsson,Erik Elmroth +4 more
TL;DR: A Performance Evaluation framework for Auto-Scaling (PEAS) strategies in the presence of uncertainties is presented and it is shown that based on the evaluation criteria, a controller can be shown to be better than other controllers.
60
Game theory models for communication between agents: a review
Aisha D. Farooqui,Muaz A. Niazi +1 more
TL;DR: This paper presents a comprehensive multidisciplinary state-of-the-art review and taxonomy of game theory models of complex interactions between agents.
Global Convergence for Replicator Dynamics of Repeated Snowdrift Games
Pouria Ramazi,Ming Cao +1 more
TL;DR: This work performs global convergence analysis for replicator dynamics of a large, well-mixed population of individuals playing a repeated snowdrift game with four typical strategies, which are always cooperate (ALLC), tit-for-tat (TFT), suspicious tit- for-Tat (STFT), and always defect (ALLD).
25
Deep Learning-Based Network Security Data Sampling and Anomaly Prediction in Future Network
TL;DR: The network security data sampling and anomaly prediction in future network can provide reference for the management strategy of the switch node or the host node by the future network controller.
References
Statistical learning theory
Vladimir Vapnik
- 01 Jan 1998
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
30.4K
A Survey of Monte Carlo Tree Search Methods
Cameron Browne,Edward J. Powley,Daniel Whitehouse,Simon M. Lucas,Peter I. Cowling,Philipp Rohlfshagen,S. Tavener,Diego Perez,Spyridon Samothrakis,Simon Colton +9 more
TL;DR: A survey of the literature to date of Monte Carlo tree search, intended to provide a snapshot of the state of the art after the first five years of MCTS research, outlines the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarizes the results from the key game and nongame domains.
Randomized Algorithms
TL;DR: For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. as discussed by the authors introduces the basic concepts in the design and analysis of randomized algorithms and provides a comprehensive and representative selection of the algorithms that might be used in each of these areas.
1.4K
The scenario approach to robust control design
TL;DR: A rich family of control problems which are in general hard to solve in a deterministically robust sense is therefore amenable to polynomial-time solution, if robustness is intended in the proposed risk-adjusted sense.
1.3K