{% extends "global/Page.html" %}
{% load static otree %}

{% block title %}
<center>Please read the following instructions carefully.</center>
{% endblock %}

{% block styles %}
    <style>
        p {
        text-align: justify
        }
     </style>
{% endblock %}

{% block content %}

<center><h4>Matching & roles</h4></center>
<p>
    In each round, all participants are matched in pairs.
    One participant within a pair has the role of player A and the other participant has the role of player B.
    The matching scheme is chosen to guarantee the following:
</p>
<ul>
    <li>
        In each round you will be randomly matched to another participant.
    </li>
    <li>
        You will never learn with whom you are matched.
    </li>
    <li>
        You will never be paired to the same participant in subsequent rounds.
    </li>
    <li>
        {% if role_change == True %}
            you will never have the same role in subsequent rounds.
        {% else %}
            You will always have the same role in all rounds.
        {% endif %}
    </li>
</ul>


<center><h4>Sequence of actions</h4></center>
    <ol>
        <li>
            In each round of the experiment, the computer will randomly roll a die with numbers between 1 and 5.
            This outcome of the die is called the <i>state</i>.
            Player A will observe the state, whereas player B will not.
        </li>
        <li>
            Player A moves first and has to choose between sending a message to player B about the state or not sending any message.
            If player A sends a message, it does not have to match the state.
            This is the only decision of player A.
        </li>
        <li>
            Player B will observe the message and choose an action between 1 and {{Constants.state_space}}.
            The decision of player B ends the round.
        </li>
    </ol>

<center><h4>Earnings</h4></center>
<p>
    In each round you can earn or lose points.
    The earnings of both players <i>depend only</i> on the state and the action of player B.
    The earnings <i>do not depend</i> on the message send by player A.
<!--    The earnings of Player A depend on how far away the action of player B is from player A's target.-->
<!--    The target equals the state of the world plus a parameter <i>b</i>.-->
<!--    In other words, player A wants player B to choose an action that is <i>b</i> higher than the state.-->
<!--    The earnings of Player B depend on how far away the action of player B is from the state.-->
<!--    In other words, player B always wants to choose the action that matches the state.-->
<!--    To be more precise the earnings for each player are given in the following equations.-->
<!--    Player A earnings are equal to 110 - 20 |state + bias - action|^{1.4}.-->
<!--    Player B earnings are equal to 110 - 20 |state - action|^{1.4}.-->
    The earnings of both players for all possible combinations of state and action will be provided to you in a table.
    The table will be shown to both of you in the decision screen.
</p>

<center>
    <button class="otree-btn-next btn btn-primary">Next</button>
</center>

{% endblock %}