On a solution of the discrete resource allocation game

DOI10.3103/S027864191402006XzbMATH Open1312.91005MaRDI QIDQ2018637FDOQ2018637

Authors: V. V. Morozov, K. D. Shalbuzov 

Publication date: 25 March 2015

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

matrix gamelinear Diophantine equationBlotto gameGross modelmodified Gomory cutresource allocation game

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) 2-person games (91A05)

Cites Work

• Title not available (Why is that?)
• An approximate method of solving Blotto games
• One modification of Gomory's algorithm
• Title not available (Why is that?)
• The discrete max‐min problem

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential, nonzero-sum ``Blotto: allocating defensive resources prior to attack
• Numerical solution of special matrix games
• Title not available (Why is that?)
• A two-resource allocation algorithm with an application to large-scale zero-sum defensive games
• Title not available (Why is that?)
• An approximate method of solving Blotto games
• Title not available (Why is that?)
• Title not available (Why is that?)
• A parallel algorithm for non-cooperative resource allocation games
• Model for protecting objects from multiple impacts

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)