On the public citation graph

Randomized sampling for large zero-sum games

0 signed · 50 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/1-84628-095-8_12openalex-snapshot
Probabilistic Robust Controller Design: Probable Near Minimax Value and Randomized Algorithms
inferredcites →https://doi.org/10.1007/11691372openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferredcites →https://doi.org/10.1007/11691372_29openalex-snapshot
PRISM: A Tool for Automatic Verification of Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-1-4471-4610-0openalex-snapshot
Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications
inferredcites →https://doi.org/10.1007/b137802openalex-snapshot
Randomized Algorithms for Analysis and Control of Uncertain Systems
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1007/s10107-005-0678-0openalex-snapshot
Ambiguous chance constrained problems and robust optimization
inferredcites →https://doi.org/10.1007/s10207-004-0060-xopenalex-snapshot
Game strategies in network security
inferredcites →https://doi.org/10.1007/s10957-009-9579-3openalex-snapshot
On the Expected Probability of Constraint Violation in Sampled Convex Programs
inferredcites →https://doi.org/10.1016/0377-2217(95)90173-6openalex-snapshot
Dynamic noncooperative game theory
inferredcites →https://doi.org/10.1016/j.arcontrol.2009.07.001openalex-snapshot
The scenario approach for systems and control design
inferredcites →https://doi.org/10.1016/s0005-1098(01)00089-9openalex-snapshot
Probabilistic solutions to some NP-hard matrix problems
inferredcites →https://doi.org/10.1016/s0167-6911(97)00005-4openalex-snapshot
Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1080/00401706.1999.10485951openalex-snapshot
Statistical Learning Theory
inferredcites →https://doi.org/10.1109/37.736014openalex-snapshot
Statistical learning theory and randomized algorithms for control
inferredcites →https://doi.org/10.1109/acc.2010.5531078openalex-snapshot
On the sample complexity of randomized approaches to the analysis and design under uncertainty
inferredcites →https://doi.org/10.1109/acc.2011.5991094openalex-snapshot
Randomized solutions to partial information dynamic zero-sum games
inferredcites →https://doi.org/10.1109/cdc.1996.573700openalex-snapshot
Randomized algorithms for robust control analysis and synthesis have polynomial complexity
inferredcites →https://doi.org/10.1109/cdc.2001.980562openalex-snapshot
Nash equilibria in partial-information games on Markov chains
inferredcites →https://doi.org/10.1109/cdc.2003.1272899openalex-snapshot
Probabilistic robust controller design: probable near minimax value and randomized algorithms
inferredcites →https://doi.org/10.1109/cdc.2010.5717870openalex-snapshot
Randomized sampling for large zero-sum games
inferredcites →https://doi.org/10.1109/tac.2006.875041openalex-snapshot
The Scenario Approach to Robust Control Design
inferredcites →https://doi.org/10.1109/tac.2008.2008335openalex-snapshot
Notes on the Scenario Design Approach
inferredcites →https://doi.org/10.1109/tac.2009.2031207openalex-snapshot
Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
inferredcites →https://doi.org/10.1109/tciaig.2012.2186810openalex-snapshot
A Survey of Monte Carlo Tree Search Methods
inferredcites →https://doi.org/10.1137/07069821xopenalex-snapshot
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
inferredcites →https://doi.org/10.1137/090773490openalex-snapshot
Random Convex Programs
inferredcites →https://doi.org/10.1145/195058.195447openalex-snapshot
Simple strategies for large zero-sum games with applications to complexity theory
inferredcites →https://doi.org/10.1145/321105.321111openalex-snapshot
Dynamic Programming Treatment of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1201/9781439864135-43openalex-snapshot
Rapidly-Exploring Random Trees: Progress and Prospects
inferredcites →https://doi.org/10.1287/moor.1040.0094openalex-snapshot
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
inferredcites →https://doi.org/10.3182/20080706-5-kr-1001.00065openalex-snapshot
The Scenario Approach for Systems and Control Design
inferredcites →https://doi.org/10.3182/20110828-6-it-1002.02511openalex-snapshot
Hide-and-Seek with Directional Sensing*

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.automatica.2014.08.029openalex-snapshot
Performance assessment and design of abstracted models for stochastic hybrid systems through a randomized approach
inferred← citeshttps://doi.org/10.1016/j.automatica.2015.07.013openalex-snapshot
On the sample size of random convex programs with structured dependence on the uncertainty
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.02.018openalex-snapshot
On incremental approximate saddle-point computation in zero-sum matrix games
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111746openalex-snapshot
A priori data-driven robustness guarantees on strategic deviations from generalised Nash equilibria
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.115openalex-snapshot
The Dating Problem and Optimal Ordering of Sequential Opportunities
inferred← citeshttps://doi.org/10.1109/cdc.2014.7039681openalex-snapshot
Incremental approximate saddle-point computation in zero-sum matrix games
inferred← citeshttps://doi.org/10.1109/cdc.2015.7403204openalex-snapshot
Optimal defensive resource allocation for a centrality-based security game on multi-hop networks
inferred← citeshttps://doi.org/10.1109/msec.2024.3407593openalex-snapshot
Game Theory in Distributed Systems Security: Foundations, Challenges, and Future Directions
inferred← citeshttps://doi.org/10.1109/tcns.2017.2728202openalex-snapshot
A Centrality-Based Security Game for Multihop Networks
inferred← citeshttps://doi.org/10.1109/tcns.2018.2873166openalex-snapshot
Incentive-Based Control of Asynchronous Best-Response Dynamics on Binary Decision Networks
inferred← citeshttps://doi.org/10.1145/2602087.2602116openalex-snapshot
Diverse virtual replicas for improving intrusion tolerance in cloud
inferred← citeshttps://doi.org/10.1145/2930659openalex-snapshot
PEAS
inferred← citeshttps://doi.org/10.1155/2020/4163825openalex-snapshot
Deep Learning-Based Network Security Data Sampling and Anomaly Prediction in Future Network
inferred← citeshttps://doi.org/10.1186/s40294-016-0026-7openalex-snapshot
Game theory models for communication between agents: a review
inferred← citeshttps://doi.org/10.48550/arxiv.1804.10932openalex-snapshot
Scenario Approach for Robust Blackbox Optimization in the Bandit Setting
inferred← citeshttps://doi.org/10.5815/ijmsc.2016.03.03openalex-snapshot
Quantum Walk Algorithm to Compute Subgame Perfect Equilibrium in Finite Two-player Sequential Games
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.