Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.00070

When and how much the altruism impacts your privileged information? Proposing a new paradigm in game theory: The boxers game

Roberto da Silva·Henrique A. Fernandes
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work, we proposed a new $N$-person game in which the players can bet on two options, for example represented by two boxers. Some of the players have privileged information about the boxers and part of them can provide this information to uninformed players. However, this information may be true if the informed player is altruist or false if he is selfish. So, in this game, the players are divided in three categories: informed and altruist players, informed and selfish players, and uninformed players. By considering the matchings ($N/2$ distinct pairs of randomly chosen players) and that the payoff of the winning group follows aspects captured from two important games, the public goods game and minority game, we showed quantitatively and qualitatively how the altruism can impact on the privileged information. We localized analytically the regions of positive payoffs which were corroborated by numerical simulations performed for all values of information and altruism densities given that we know the information level of the informed players. Finally, in an evolutionary version of the game ,we showed that the gain of the informed players can get worse if we adopted the following procedure: the players increase their investment for situations of positive payoffs, and decrease their investment when negative payoffs occur.

Explore related subjects

cond-mat.stat-mechcs.GT

Keep this discovery

BibTeXRIS

Roberto da Silva, Henrique A. Fernandes. 2017-11-30. When and how much the altruism impacts your privileged information? Proposing a new paradigm in game theory: The boxers game. https://doi.org/10.1016/j.physa.2018.02.209

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗