Imitation as the Simplest Strategy for Cooperation

Date

2012-01-01

Author

Durmus, Yunus
Onur, Ertan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

204
views

0
downloads

Ad hoc networks comprise independent cooperative nodes which work together to constitute a system having a value greater than the sum of the values of the individual components. The nodes cooperate to gain access to the medium or to establish a messaging infrastructure by relaying foreign packets. However, when nodes in an ad hoc network operate autonomously without a central authority, they tend to defect, e.g., do not forward each other's packets following the game theoretic analysis. External mechanisms may preserve and enforce cooperation in network in return of additional operational costs or security overheads. However, low power devices may lack computational power that is required to implement the system. Recent works in evolutionary game theory have shown that cooperation may survive in a lattice structured biological network without any enforcement. The spatial structure of the network may allow the survival of the cooperative nodes when they imitate the dominant surrounding strategy. Imitating strategy helps low power devices adapt dynamically to the environment rather than giving deterministic and static decisions. In this work, we apply the imitation strategy to ad hoc networks which have geometric random network structure different from the lattice structured networks. Simulations show that simple imitation strategy allows cooperation to be spread over the network.

Subject Keywords

Cooperation, Network reciprocity, Forwarder's game, Prisoner's dilemma, Evolutionary game theory, Wireless Ad Hoc networks

URI

https://hdl.handle.net/11511/41437

DOI

https://doi.org/10.1109/pimrc.2012.6362905

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Dynamic signaling games with quadratic criteria under Nash and Stackelberg equilibria Yuksel, Serdar; Sarıtaş, Serkan; Gezici, Sinan (2020-05-01) This paper considers dynamic (multi-stage) signaling games involving an encoder and a decoder who have subjective models on the cost functions. We consider both Nash (simultaneous-move) and Stackelberg (leader-follower) equilibria of dynamic signaling games under quadratic criteria. For the multi-stage scalar cheap talk, we show that the final stage equilibrium is always quantized and under further conditions the equilibria for all time stages must be quantized. In contrast, the Stackelberg equilibria are a...
Hierarchical control with partial observations: Sufficient conditions Boutin, Olivier; Komenda, Jan; Masopust, Tomas; Schmidt, Klaus Verner; Van Schuppen, Jan H. (2011-12-01) In this paper, hierarchical control of both monolithic and modular discrete-event systems under partial observations is studied. Two new conditions, called observation consistency and local observation consistency, are proposed. These conditions are sufficient for the preservation of observability between the original and the abstracted plant. Moreover, it is shown that both conditions are compositional, that is, they are preserved by the synchronous product. This property makes it possible to use hierarchi...
Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria Kazikli, Ertan; Sarıtaş, Serkan; GEZİCİ, Sinan; Linder, Tamas; Yuksel, Serdar (2022-03-01) We investigate the equilibrium behavior for the decentralized cheap talk problem for real random variables and quadratic cost criteria in which an encoder and a decoder have misaligned objective functions. In prior work, it has been shown that the number of bins in any equilibrium has to be countable, generalizing a classical result due to Crawford and Sobel who considered sources with density supported on [0, 1]. In this paper, we first refine this result in the context of log-concave sources. For sources ...
Fuzzy Hybrid Systems modeling with application in decision making and control Boutalis, Yiannis; Moor, Thomas; Schmidt, Klaus Verner (2012-11-28) Hybrid Systems are systems containing both discrete event and continuous variable components. Many recent contributions address crisp situations, where ambiguity or subjectivity in the measured data is absent. In this paper, we propose Fuzzy Hybrid Systems to account for inaccurate measurements and uncertain dynamics. We present a strategy to determine the most appropriate control actions in a sampled data setting. The proposed approach is based on three basic steps that are performed in each sampling perio...
VARIATION OF LYAPUNOV METHOD FOR DYNAMIC-SYSTEMS ON TIME SCALES KAYMAKCALAN, B; RANGARAJAN, L (Elsevier BV, 1994-07-15) A new comparison theorem that connects the solutions of perturbed and unperturbed dynamic systems in a manner useful to the theory of perturbations is given and this comparison theorem is employed as a stability criterion to compare the asymptotic behaviors of perturbed and unperturbed systems. It is further shown by means of both theory and numerical computation that time scales do offer a unification in order to emphasize the better asymptotic behavior of perturbed systems in both continuous and discrete ...

Citation Formats

Y. Durmus and E. Onur, “Imitation as the Simplest Strategy for Cooperation,” 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41437.