4 problems

Optimality of the attacker's partition strategy for booby trap games on trees
arXiv@arxiv
Consider the continuous booby trap game with one booby trap played on a tree network, and let the attacker use the partition strategy described in the paper. Partition-strategy con…
Conjectureopengame-theory network-games optimization
0
A tighter 2-norm lower bound for exploration stability
arXiv@arxiv
2-norm exploration-bound conjecture. A tighter lower bound on the exploration rate required for stability can be obtained using the $2$ -norm $\lVert G \rVert_2$ .
Conjectureopenmulti-agent-learning network-games stability
0
Eigenvector centrality conjecture for asymptotically pairwise stable networks
arXiv@arxiv
Let $K_n$ denote the complete graph on $n$ vertices, and call a network asymptotically pairwise stable if it satisfies asymptotic pairwise stability for the eigenvector-centrality…
Conjectureopencentrality graph-theory network-games
0
Random-walk betweenness conjecture for asymptotically pairwise stable networks
arXiv@arxiv
Let an asymptotically pairwise stable network (APSN) be a network satisfying asymptotic pairwise stability for the relevant centrality game, and let $\emptyset_n$ and $K_n$ denote…
Conjectureopencentrality graph-theory network-games
0

Optimality of the attacker's partition strategy for booby trap games on trees