Affordable Access

Taxed Congestion Games with Failures

Publication Date
  • Computer Science


In this paper, we introduce and study Taxed Congestion Games with Failures [TCGFs], extending congestion games with failures [CGFs] to consider costly task submission. We define TCGFs, and prove that TCGFs possess a pure strategy equilibrium. Moreover, we provide an efficient algorithm for the computation of such equilibrium. We also provide a specialized, simpler, algorithm for the case in which all resources are identical.

There are no comments yet on this publication. Be the first to share your thoughts.