An idempotent algorithm for a class of network-disruption games.

DOI10.14736/KYB-2016-5-0666MaRDI QIDQ2955999zbMATH OpenOpenAlexFDO

Authors William M. Mceneaney, Amit Pandey

Publication date 13 January 2017

Published in Kybernetika (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10338.dmlcz/145963

zbMATH Keywords

networkdynamic programminggame theorymax-plus algebratropical algebraidempotent algebracommand and control

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Max-plus and related algebras (15A80) Idempotents, Peirce decompositions (17C27) Games involving graphs (91A43) Public goods (91B18)

Recommendations

• scientific article; zbMATH DE number 2094482
• Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
• Equilibria for games in idempotent measures
• Network models of discrete optimal control and dynamic games with p players
• Discrete control and algorithms for solving antagonistic dynamic games on networks

Cited in

(1)

• Development of an idempotent algorithm for a network-delay game

This page was built for publication: An idempotent algorithm for a class of network-disruption games.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2955999)