EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3886. Clustering prevention games on signed networks
Invited abstract in session TB-36: Game Theory, Solutions and Structures VI, stream Game Theory, Solutions and Structures.
Tuesday, 10:30-12:00Room: 32 (building: 306)
Authors (first author is the speaker)
| 1. | Maria Serna
|
| Computer Science Dept. and Institute of Mathematics of UPC-BarcelonaTech, Universitat Politècnica de Catalunya | |
| 2. | Xavier Molinero
|
| Mathematics, Universitat Politècnica de Catalunya · BarcelonaTech | |
| 3. | Fabian Riquelme
|
| Escuela de Ingeniería Informática, Universidad de Valparaíso |
Abstract
Signed networks are graphs in which each edge has associated a sign. They were introduced as a simplified model to analyze social relationships. A positive sign in an interaction represents friendship while a negative one means animosity. Central notions in signed networks relate to the possibility of partition the vertices into clusters so that the positive edges join vertices in the same cluster and the negative edges join vertices in different clusters. This leads to two relevant notions: structural balance (having such a partition into two clusters) and social equilibrium (having such a partition). We study signed graphs with respect to these two notions from the point of view of cooperative game theory. We first introduce some new families of simple games on signed network and analyze several parameters and properties. We compare them to the ones known for other subclasses of simple games, in particular with social disruption games which were introduced regarding social equilibrium. In addition, we give some complexity results on the considered properties.
[Supported by Spanish AEI grant MICINN PID2020-112581GB-C21]
Keywords
- Game Theory
- Social Networks
- Complexity and Approximation
Status: accepted
Back to the list of papers