Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Dario Madeo"'
Publikováno v:
Mathematics, Vol 12, Iss 4, p 604 (2024)
We explore strong Nash equilibria in the max k-cut game on an undirected and unweighted graph with a set of k colors. Here, the vertices represent players, and the edges denote their relationships. Each player, v, selects a color as its strategy, and
Externí odkaz:
https://doaj.org/article/37ddb244fc3d4fc0af9b6857453fe6ed
Publikováno v:
Scientific Reports, Vol 11, Iss 1, Pp 1-20 (2021)
Abstract Understanding the dynamics of cooperative behavior of individuals in complex societies represents a fundamental research question which puzzles scientists working in heterogeneous fields. Many studies have been developed using the unitary ag
Externí odkaz:
https://doaj.org/article/aeb762503d5c444b84665e85383c1347
Publikováno v:
Mathematical Biosciences and Engineering, Vol 16, Iss 5, Pp 5287-5306 (2019)
Recently, a new mathematical formulation of evolutionary game dynamics [1] has been introduced accounting for a finite number of players organized over a network, where the players are located at the nodes of a graph and edges represent connections b
Externí odkaz:
https://doaj.org/article/4a74bd494945485bac8159b3e1dbae03
Publikováno v:
Mathematics, Vol 10, Iss 15, p 2781 (2022)
This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut games over unweighted and undirected graphs do not allow the formation of any strongly divergent coalition, i.e., a subset of nodes able to increase thei
Externí odkaz:
https://doaj.org/article/9b0c74fcd4274944852dfb3f0b63ed9a
Autor:
Dario Madeo, Chiara Mocenni
Publikováno v:
Games, Vol 13, Iss 1, p 10 (2022)
The effectiveness of control measures against the diffusion of the COVID-19 pandemic is grounded on the assumption that people are prepared and disposed to cooperate. From a strategic decision point of view, cooperation is the unreachable strategy of
Externí odkaz:
https://doaj.org/article/69f9be56c0324e19ae3d602df8d76fa7
Autor:
Dario Madeo, Chiara Mocenni
Publikováno v:
Games, Vol 12, Iss 3, p 60 (2021)
Cooperation is widely recognized to be fundamental for the well-balanced development of human societies. Several different approaches have been proposed to explain the emergence of cooperation in populations of individuals playing the Prisoner’s Di
Externí odkaz:
https://doaj.org/article/2102f20a02514be5bead0e019d50803c
Publikováno v:
Pure Mathematics and Applications. 30:82-89
We investigate strong Nash equilibria in the max k-cut game on an undirected and unweighted graph with a set of k colors, where vertices represent players and the edges indicate their relations. Each player v chooses one of the available colors as it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d671015f23afb1ec193e5239e0fc5a4c
https://doi.org/10.2478/puma-2022-0013
https://doi.org/10.2478/puma-2022-0013
Publikováno v:
Mathematics; Volume 10; Issue 15; Pages: 2781
This paper provides a formal proof of the conjecture stating that optimal colorings in max k-cut games over unweighted and undirected graphs do not allow the formation of any strongly divergent coalition, i.e., a subset of nodes able to increase thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c177c4ffcdc59138dd31d34072327119
Autor:
Chiara Mocenni, Dario Madeo
Publikováno v:
Games, Vol 12, Iss 60, p 60 (2021)
Games
Volume 12
Issue 3
Games
Volume 12
Issue 3
Cooperation is widely recognized to be challenging for the well-balanced development of human societies. The emergence of cooperation in populations has been largely studied in the context of the Prisoner's Dilemma game, where temptation to defect an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39cf13c352b906ec9cfdd4e8b0f186c5
https://doi.org/10.20944/preprints202107.0343.v1
https://doi.org/10.20944/preprints202107.0343.v1
Publikováno v:
Mathematical Biosciences and Engineering. 16:5287-5306
Recently, a new mathematical formulation of evolutionary game dynamics [1] has been introduced accounting for a finite number of players organized over a network, where the players are located at the nodes of a graph and edges represent connections b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1642537d0616177d398fe906672b91b6
https://doi.org/10.3934/mbe.2019264
https://doi.org/10.3934/mbe.2019264