Edge-dominance games on graphs

TL;DR

This paper analyzes zero-sum edge-dominance games on graphs, characterizing equilibria based on graph topology and geometry, and provides efficient methods to compute pure equilibria in certain graph classes.

Contribution

It introduces a novel analysis of edge-dominance games, linking equilibria to graph structures like block-cut trees and outerplanar properties, with efficient computation methods.

Findings

Expected payoff characterized for graphs without certain small cycles.

Existence of pure equilibria in strongly connected outerplanar graphs with girth ≥ 4.

Efficient data structure for all pure equilibria in these games.

Abstract

We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high ground or camouflage, or product characteristics that lend an advantage over competing sellers in a duopoly. We study the equilibria of the game as a function of the topological and geometric properties of the underlying graph. Our main result characterizes the expected payoff of both players starting from any initial position, under the assumption that the graph does not contain certain types of small cycles. This characterization leverages the block-cut tree of the graph, a construction that describes the topology of the biconnected components of the graph. We identify three natural types of (on-path) pure equilibria, and characterize when these equilibria exist under the above assumptions. On the geometric side, we show that strongly connected outerplanar graphs with undirected girth at least 4 always support some of these types of on-path pure equilibria. Finally, we show that a data structure describing all pure equilibria can be efficiently computed for these games.