Stackelberg strategies on epidemic containment games
From MaRDI portal
(Redirected from Stackelberg strategies on epidemic containment games)
Recommendations
Cites work
- Clustering and domination in perfect graphs
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
- Greed is good: approximating independent sets in sparse and bounded-degree graphs
- scientific article; zbMATH DE number 1003268 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Lower Bounds for Maximal Matchings and Maximal Independent Sets
- On minimum maximal independent sets of a graph
- Optimal Quarantining of Wireless Malware Through Reception Gain Control
- Ottimizzazione Combinatoria
Cited in
(3)
This page was built for publication: Stackelberg strategies on epidemic containment games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535824)