We consider the two-person zero-sum game in which the strategy sets for Players I and II consist of the vertices and the edges of a directed graph respectively.If Player I chooses vertex v and Player II chooses edge e; then the payoff is zero if v and e are not incident and otherwise it is 1 or _1 according as e originates or terminates at v: We obtain an explicit expression for the value of this game and describe the structure of optimal strategies.A similar problem is considered for undirected graphs and it is shown to be related to the theory of 2-matchings in graphs.
|Place of Publication||Tilburg|
|Number of pages||14|
|Publication status||Published - 1996|
|Name||FEW Research Memorandum|