Development of an Idempotent Algorithm for a Network-Delay Game

Abstract

A game is considered where the communication network of the first player is explicitly modeled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modeled through expectations over idempotent probability measures. Idempotent algebras are used to obtain an algorithm for solution of the game.