On a solution of the discrete resource allocation game
From MaRDI portal
Publication:2018637
Recommendations
- Discrete Colonel Blotto and general lotto games
- Solution of a game-theoretical model of resource allocation
- Games with allocation of discrete resources to serval sites
- Zero-sum game of resource allocation: attacker against defender
- Sequential, nonzero-sum ``Blotto: allocating defensive resources prior to attack
Cites work
Cited in
(15)- An approximate method of solving Blotto games
- Zero-sum game of resource allocation: attacker against defender
- An algorithmic solution to the Blotto game using multimarginal couplings
- scientific article; zbMATH DE number 3062449 (Why is no real title available?)
- Model for protecting objects from multiple impacts
- scientific article; zbMATH DE number 6936827 (Why is no real title available?)
- scientific article; zbMATH DE number 1841911 (Why is no real title available?)
- Solution of a game-theoretical model of resource allocation
- A two-resource allocation algorithm with an application to large-scale zero-sum defensive games
- Numerical solution of special matrix games
- scientific article; zbMATH DE number 4145710 (Why is no real title available?)
- scientific article; zbMATH DE number 1908200 (Why is no real title available?)
- scientific article; zbMATH DE number 7110187 (Why is no real title available?)
- A parallel algorithm for non-cooperative resource allocation games
- Sequential, nonzero-sum ``Blotto: allocating defensive resources prior to attack
This page was built for publication: On a solution of the discrete resource allocation game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018637)