Results 1 to 10 of about 402,229 (236)
Cooperative Solutions in Multi-Star Network Games
A model also known as multi-agent systems, namely the multistar model is considered. In a multi-agent system, a two-level game is played, the first-level is the external game, and the second-level is the internal game.
Lu Tian, Jianpeng Zhang
semanticscholar +1 more source
S-invariant Termwise Addition of Reactions Via Reaction Vector Multiples (STAR-RVM) Transformation
Interest in connecting Chemical Reactions Network Theory (CRNT) and evolutionary game theory (EGT) arise viewing the tools of network in the analysis of evolutionary games.
Daryl Magpantay
semanticscholar +1 more source
Stability of Complete and Star Multiplex Networks
We propose a concept of stability for multiplex networks. First, a utility function combining benefits and costs from network connections is introduced.
Ma Ziyu, Elena M. Parilina
semanticscholar +1 more source
An Invasion of Tricksters. Critical Remarks on Bruno Latour’s Social Theory and Its Polish Reception
ing this matter – without previous assumptions, including axiological ones – what a scientist like a sociologist claims about the society is no way more binding than what is said by a politician, a film star, a bishop-intellectual, a religious zealot, or
M. Kaczmarczyk
semanticscholar +1 more source
When Should the Chicken Cross the Road? - Game Theory for Autonomous Vehicle - Human Interactions
Autonomous vehicle control is well understood for local- [15], good approximations exist such as particle ltering, ization, mapping and planning in un-reactive environ- which make use of large compute power to draw samples ments, but the human factors
Charles W. Fox+5 more
semanticscholar +1 more source
Inequality and Network Formation Games [PDF]
This paper addresses the matter of inequality in network formation games. We employ a quantity that we are calling the Nash Inequality Ratio (NIR), defined as the maximal ratio between the highest and lowest costs incurred to individual agents in a Nash ...
D'Souza, Raissa M., Johnson, Samuel D.
core +1 more source
Strong Ramsey Games in Unbounded Time [PDF]
For two graphs $B$ and $H$ the strong Ramsey game $\mathcal{R}(B,H)$ on the board $B$ and with target $H$ is played as follows. Two players alternately claim edges of $B$. The first player to build a copy of $H$ wins. If none of the players win, the game
David, Stefan+2 more
core +2 more sources
Communication, coordination and networks [PDF]
We study experimentally how the network structure and length of pre-play communication affect behavior and outcome in a multi-player coordination game with conflicting preferences.
Choi, S., Lee, J.
core +4 more sources
To evaluate the steady-state availability of heterogeneous edge computing-enabled wireless sensor networks (HECWSNs) with malware infections, we fi rst propose a Stackelberg attack-defence game to predict the optimal strategies of malware and intrusion ...
Hong Zhang+4 more
semanticscholar +1 more source
A cognitive hierarchy model of learning in networks [PDF]
This paper proposes a method for estimating a hierarchical model of bounded rationality in games of learning in networks. A cognitive hierarchy comprises a set of cognitive types whose behavior ranges from random to substantively rational.
Choi, S
core +1 more source