When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2017.38
URN: urn:nbn:de:0030-drops-83738
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8373/
 Go to the corresponding LIPIcs Volume Portal

### Flow Games

 pdf-format:

### Abstract

In the traditional maximal-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing edges. While the problem has been extensively used in order to optimize the performance of networks in numerous application areas, it corresponds to a setting in which the authority has control on all vertices of the network. Today's computing environment involves parties that should be considered adversarial. We introduce and study {\em flow games}, which capture settings in which the authority can control only part of the vertices. In these games, the vertices are partitioned between two players: the authority and the environment. While the authority aims at maximizing the flow, the environment need not cooperate. We argue that flow games capture many modern settings, such as partially-controlled pipe or road systems or hybrid software-defined communication networks. We show that the problem of finding the maximal flow as well as an optimal strategy for the authority in an acyclic flow game is $\Sigma_2^P$-complete, and is already $\Sigma_2^P$-hard to approximate. We study variants of the game: a restriction to strategies that ensure no loss of flow, an extension to strategies that allow non-integral flows, which we prove to be stronger, and a dynamic setting in which a strategy for a vertex is chosen only once flow reaches the vertex. We discuss additional variants and their applications, and point to several interesting open problems.

### BibTeX - Entry

@InProceedings{kupferman_et_al:LIPIcs:2018:8373,
author =	{Orna Kupferman and Gal Vardi and Moshe Y. Vardi},
title =	{{Flow Games}},
booktitle =	{37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
pages =	{38:38--38:16},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-055-2},
ISSN =	{1868-8969},
year =	{2018},
volume =	{93},
editor =	{Satya Lokam and R. Ramanujam},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},