The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper considers a distributed aggregative game problem for a group of players with misinformation, where each player has a different perception of the game. Player’s deception behavior is inevitable in this situation for reducing its own cost. We utilize hypergame to model the above problems and adopt -Nash equilibrium for hypergame to investigate whether players believe in their own cognition. Additionally, we propose a distributed deceptive algorithm for a player implementing deception and...
Proving properties of distributed algorithms is still a highly challenging problem and various approaches that have been proposed to tackle it [1] can be roughly divided into state-based and event-based proofs. Informally speaking, state-based approaches define the behavior of a distributed algorithm as a set of sequences of memory states during its executions, while event-based approaches treat the behaviors by means of events which are produced by the executions of an algorithm. Of course, combined...
Currently displaying 1 –
3 of
3