EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3998. Properties and parameters of social disruption games

Invited abstract in session TB-36: Game Theory, Solutions and Structures VI, stream Game Theory, Solutions and Structures.

Tuesday, 10:30-12:00
Room: 32 (building: 306)

Authors (first author is the speaker)

1. Xavier Molinero
Mathematics, Universitat Politècnica de Catalunya · BarcelonaTech
2. Fabian Riquelme
Escuela de Ingeniería Informática, Universidad de Valparaíso
3. Salvador Roura
Computer Science, Universitat Politècnica de Catalunya - BarcelonaTech
4. Maria Serna
Computer Science Dept. and Institute of Mathematics of UPC-BarcelonaTech, Universitat Politècnica de Catalunya

Abstract

Signed graphs are extensively used across various real-world social networks, where positive edges represent favourable relationships (friends, colleagues) and negative edges denote unfavourable ones (enemies, adversaries). Some previous research in signed graphs has focused on defining properties to evaluate clustering tendencies in the sense that the positive edges join vertices in the same cluster and the negative edges join vertices in different clusters. This work gives theoretical and experimental results of the so-called social disruption games. These games form a subclass of the simple games defined in the classical game theory. Social disruption games satisfies that a set of vertices is a winning coalition if and only if the subgraph induced by the coalition contains a cycle with only one negative edge. In this work, we explore properties such as properness, strongness, and decisiveness, among others. We also give some results on parameters like length, width, strict length, and strict width, etc. Finally, we present signed graphs that define social disruption games with specific properties and parameters (vetoers, critical players, symmetric players, etc.).

[Supported by Spanish AEI grant MICINN PID2020-112581GB-C21]

Keywords

Status: accepted

Back to the list of papers