SearcharxivSearch

arXiv subjects

Giulia Palma

Publications and source records attributed to Giulia Palma.

3 recordsLinked to original sources

Symbiosis as a systemic catalyst and the impossibility of coalitions in optimal networks

The stability of complex systems hinges on the tension between individual incentives and collective welfare. Modeling these dynamics through strategic network interactions based on anti-coordination, we formally prove that any globally optimal configuration constitutes a Strong Nash Equilibrium, creating topological barriers against collective deviations. However, in sub-optimal states, strictly individualistic agents remain trapped in stagnant equilibria. We show that coalition formation acts as a vital catalyst for global efficiency. Paralleling Tomasello's evolutionary theory of shared intentionality, the emergence of symbiotic joint agency overcomes selfish stagnation and drives the system toward optimal niche partitioning. We validate our framework through extensive computational simulations and apply it to an empirical pollination network, demonstrating how symbiosis may steer real-world ecosystems toward maximum resilience. We uncover metastable dynamics where coalitions continuously reconfigure, revealing that biological evolution relies on a perpetual, adaptive balance between competition and cooperation.

physics.soc-ph

The Max k-Cut Game: On Stable Optimal Colorings

We study the max k-cut game on an undirected and unweighted graph in order to find out whether an optimal solution is also a strong equilibrium. While we do fail to show that, by proving an alternate formula for computing the cut value difference for a strong deviation, we show that optimal solutions are 7-stable equilibria. Furthermore, we prove some properties of minimal subsets with respect to a strong deviation, showing that each of their nodes will deviate towards the color of one of their neighbors and that those subsets induce connected subgraphs.

cs.GT

A study on the fixed points of the $γ$ function

Recently a permutation on Dyck paths, related to the chip firing game, was introduced and studied by Barnabei et al.. It is called $γ$-operator, and uses symmetries and reflections to relate Dyck paths having the same length. A relevant research topic concerns the study of the fixed points of $γ$ and a characterization of these objects was provided by Barnabei et al, leaving the problem of their enumeration open. In this paper, using tools from combinatorics of words, we determine new combinatorial properties of the fixed points of $γ$. Then we present an algorithm, denoted by \textbf{GenGammaPath}($t$), which receives as input an array $t=(t_0, \ldots ,t_{k})$ of positive integers and generates all the elements of $F_γ$ with degree $k$.

math.CO