M. T. Estañ Pereña, V. Fragnelli
In this work we define several simple games related to the networks flow problems. In particular we are focused on the Path problems, that is the problems that send a flow from Source to Sink, independent of the flow value or others concepts like the minimun path for example.We are interested in analyzing the relevance of the players (arcs) that belong to the game.To do that we study the path problems from the point of view of criticality orders and we conclude that there may exist players that are never critical. To give a solution of this situation we present two different approachs: Quantitative (by computing two power index) and Qualitative (we propose a rank of players).
Palabras clave: Game theory, directed graph, flow problems, order of criticality.
Programado
Teoría de Juegos
9 de junio de 2022 17:10
A14
