5,205 research outputs found
Adoption of simultaneous different strategies against different opponents enhances cooperation
The emergence of cooperation has been widely studied in the context of game theory on structured populations. Usually the individuals adopt one strategy against all their neighbors. The structure can provide reproductive success for the cooperative strategy, at least for low values of defection tendency. Other mechanisms, such punishment, can also be responsible for cooperation emergence. But what happens if the players adopt simultaneously different strategies against each one of their opponents, not just a single one? Here we study this question in the prisoner dilemma scenario structured on a square lattice and on a ring. We show that if an update rule is defined in which the players replace the strategy that furnishes the smallest payoff, a punishment response mechanism against defectors without imputing cost to the punishers appears, cooperation dominates and, even if the tendency of defection is huge, cooperation still remains alive
Distinguishing the opponents in the prisoner dilemma in well-mixed populations
Here we study the effects of adopting different strategies against different
opponent instead of adopting the same strategy against all of them in the
prisoner dilemma structured in well-mixed populations. We consider an
evolutionary process in which strategies that provide reproductive success are
imitated and players replace one of their worst interactions by the new one. We
set individuals in a well-mixed population so that network reciprocity effect
is excluded and we analyze both synchronous and asynchronous updates. As a
consequence of the replacement rule, we show that mutual cooperation is never
destroyed and the initial fraction of mutual cooperation is a lower bound for
the level of cooperation. We show by simulation and mean-field analysis that
for synchronous update cooperation dominates while for asynchronous update only
cooperations associated to the initial mutual cooperations are maintained. As a
side effect of the replacement rule, an "implicit punishment" mechanism comes
up in a way that exploitations are always neutralized providing evolutionary
stability for cooperation
Quantifying the Impact of Non-Stationarity in Reinforcement Learning-Based Traffic Signal Control
In reinforcement learning (RL), dealing with non-stationarity is a
challenging issue. However, some domains such as traffic optimization are
inherently non-stationary. Causes for and effects of this are manifold. In
particular, when dealing with traffic signal controls, addressing
non-stationarity is key since traffic conditions change over time and as a
function of traffic control decisions taken in other parts of a network. In
this paper we analyze the effects that different sources of non-stationarity
have in a network of traffic signals, in which each signal is modeled as a
learning agent. More precisely, we study both the effects of changing the
\textit{context} in which an agent learns (e.g., a change in flow rates
experienced by it), as well as the effects of reducing agent observability of
the true environment state. Partial observability may cause distinct states (in
which distinct actions are optimal) to be seen as the same by the traffic
signal agents. This, in turn, may lead to sub-optimal performance. We show that
the lack of suitable sensors to provide a representative observation of the
real state seems to affect the performance more drastically than the changes to
the underlying traffic patterns.Comment: 13 page
Locally linear embedding-based prediction for 3D holoscopic image coding using HEVC
Holoscopic imaging is a prospective acquisition and display solution for providing true 3D content and fatigue-free 3D visualization. However, efficient coding schemes for this particular type of content are needed to enable proper storage and delivery of the large amount of data involved in these systems. Therefore, this paper proposes an alternative HEVC-based coding scheme for efficient representation of holoscopic images. In this scheme, some directional intra prediction modes of the HEVC are replaced by a more efficient prediction framework based on locally linear embedding techniques. Experimental results show the advantage of the proposed prediction for 3D holoscopic image coding, compared to the reference HEVC standard as well as previously presented approaches in this field.info:eu-repo/semantics/submittedVersio
Light field HEVC-based image coding using locally linear embedding and self-similarity compensated prediction
Light field imaging is a promising new technology that allows the user not only to change the focus and perspective after taking a picture, as well as to generate 3D content, among other applications. However, light field images are characterized by large amounts of data and there is a lack of coding tools to efficiently encode this type of content. Therefore, this paper proposes the addition of two new prediction tools to the HEVC framework, to improve its coding efficiency. The first tool is based on the local linear embedding-based prediction and the second one is based on the self-similarity compensated prediction. Experimental results show improvements over JPEG and HEVC in terms of average bitrate savings of 71.44% and 31.87%, and average PSNR gains of 4.73dB and 0.89dB, respectively.info:eu-repo/semantics/acceptedVersio
- …