Munich Personal RePEc Archive
metadata only
Adversarial scheduling analysis of Game-Theoretic Models of Norm Diffusion.
In (Istrate et al. SODA 2001) we advocated the investigation of robustness of results in the theory of learning in games under adversarial scheduling models. We provide evidence that such an analysis is feasible and can lead to nontrivial results by investigating, in an adversarial scheduling settin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Interaction of Compressibility and Adversarial Robustness#1118405
- Robust Adversarial Reinforcement Learning with Risk Sensitivity and Critic Consistency Regularization#1064211
- Time Semantics and Liveness Artifacts in Adversarial Consensus Simulation#1117684
- Official Review · ICLR 2024#787038
- Towards One-for-All Robustness Across a Continuum of Threat Levels#924322
Record · ID 1277874
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive