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. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along th...

Machine checked proofs of type inference algorithms often axiomatize MGU behavior as a set of axioms. Idempotent MGUs for a list of equational constraints are needed to reason about the correctness of Wand’s type inference algorithm and our extension of it. To characterize the behavior of idempotent MGUs, we propose a set of seven axioms; four of which have been proven in our earlier paper, whe...

An Abelian group is called idempotent if any element for some multiplication. This paper contains a complete description of torsion-free groups and periodic groups. We also give mixed