Solving the General Case of Rank-3 Maker-Breaker Games in Polynomial Time

09/22/2022
by   Lear Bahack, et al.
0

A rank-3 Maker-Breaker game is played on a hypergraph in which all hyperedges are sets of at most 3 vertices. The two players of the game, called Maker and Breaker, move alternately. On his turn, maker chooses a vertex to be withdrawn from all hyperedges, while Breaker on her turn chooses a vertex and delete all the hyperedges containing that vertex. Maker wins when by the end of his turn some hyperedge is completely covered, i.e. the last remaining vertex of that hyperedge is withdrawn. Breaker wins when by the end of her turn, all hyperedges have been deleted. Solving a Maker-Breaker game is the computational problem of choosing an optimal move, or equivalently, deciding which player has a winning strategy in a configuration. The complexity of solving two degenerate cases of rank-3 games has been proven before to be polynomial. In this paper, we show that the general case of rank-3 Maker-Breaker games is also solvable in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2022

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3

In the Maker-Breaker positional game, Maker and Breaker take turns picki...
research
07/25/2018

Maker-Breaker domination game

We introduce the Maker-Breaker domination game, a two player game on a g...
research
04/08/2019

A Manifold of Polynomial Time Solvable Bimatrix Games

This paper identifies a manifold in the space of bimatrix games which co...
research
05/06/2023

A Game of Pawns

We introduce and study pawn games, a class of two-player zero-sum turn-b...
research
11/22/2022

Stabilization of Capacitated Matching Games

An edge-weighted, vertex-capacitated graph G is called stable if the val...
research
05/07/2022

The general position avoidance game and hardness of general position games

Given a graph G, a set S of vertices in G is a general position set if n...
research
07/30/2021

The Pyro game: a slow intelligent fire

In the Firefighter problem, a fire breaks out at a vertex of a graph and...

Please sign up or login with your details

Forgot password? Click here to reset