Computation of Nash Equilibria of Attack and Defense Games on Networks

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Kaźmierowski, Stanisław, Dziubiński, Marcin
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866929286876758016
author Kaźmierowski, Stanisław
Dziubiński, Marcin
author_facet Kaźmierowski, Stanisław
Dziubiński, Marcin
contents We consider the computation of a Nash equilibrium in attack and defense games on networks (Bloch et al. [1]). We prove that a Nash Equilibrium of the game can be computed in polynomial time with respect to the number of nodes in the network. We propose an algorithm that runs in O(n4) time with respect to the number of nodes of the network, n.
format Preprint
id arxiv_https___arxiv_org_abs_2309_04288
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Computation of Nash Equilibria of Attack and Defense Games on Networks
Kaźmierowski, Stanisław
Dziubiński, Marcin
Computer Science and Game Theory
ACM-class: J.4
We consider the computation of a Nash equilibrium in attack and defense games on networks (Bloch et al. [1]). We prove that a Nash Equilibrium of the game can be computed in polynomial time with respect to the number of nodes in the network. We propose an algorithm that runs in O(n4) time with respect to the number of nodes of the network, n.
title Computation of Nash Equilibria of Attack and Defense Games on Networks
topic Computer Science and Game Theory
ACM-class: J.4
url https://arxiv.org/abs/2309.04288