Dynamics in Braess Paradox with Nonimpulsive Commuters

In Braess paradox the addiction of an extra resource creates a social dilemma in which the individual rationality leads to collective irrationality. In the literature, the dynamics has been analyzedwhen considering impulsive commuters, i.e., those who switch choice regardless of the actual difference between costs. We analyze a dynamical version of the paradox with nonimpulsive commuters, who change road proportionally to the cost difference. When only two roads are available, we provide a rigorous proof of the existence of a unique fixed point showing that it is globally attracting even if locally unstable. When a new road is added the system becomes discontinuous and two-dimensional.We prove that still a unique fixed point exists, and its global attractivity is numerically evidenced, also when the fixed point is locally unstable. Our analysis adds a new insight in the understanding of dynamics in social dilemma.


Introduction
Assume that two different points of a network-an origin and a destination-are connected by two possible roads only.The Braess paradox states that, under specific conditions, adding a third road to the network decreases the efficiency of the network.This phenomenon is known in the transportation field and more general scientific literature (see [1][2][3][4][5][6][7][8][9][10]).Braess' paradox occurs because commuters try to minimize their own travel time ignoring the effect of their decisions on other commuters on the network.As a result, the total travel time may increase following an expansion of the network; in fact, even if some commuters are better off using the new link, they contribute to increase the congestion for other commuters.
The theoretical literature of the Braess paradox is particularly productive, especially in transportation, communication, and computer science (far from being exhaustive, see, e.g., [10,11]).Almost all the existing works have considered the basic network similar to the one presented in this paper, with the addition of a single link.Notably, [12] proposes a broader class of Braess graphs.A measure of the robustness of the dynamic network considering the influence of the flow on other links when certain component (node or link) is removed can be found in [13].The empirical literature provides evidence in support of the paradox.For example, in [14] examples are reported that occurred on a modeled network of the city of Winnipeg, while [15] focus on a portion of the Boston road network.The experimental works are interested in studying the occurrence of the paradox in a controlled setting (see, e.g., [16][17][18][19][20]), not only in basic but also in augmented networks.This literature provides evidence in strong support of the paradox in some cases (see [18]), while statistically significant, but weaker support in some other cases (see [16,17,19,20]).A comparison of public versus private monitoring using the same participants is performed in [21] to investigate how the type of monitoring affects route choice.Interest in possible behaviors and composition of the population facing the basic network can be found in [22] which analyze the data gathered from the observation of an experiment with human participants, codes artificial behaviors emerged by mean of grounded theory, and uses ABM simulations.For a review on ABM with special focus on spacial interactions and networks see [23].
The paradox has also been presented in a dynamic game framework.A discrete time dynamic population model with social externalities and two available choices is studied in [24] simulating an adaptive adjustment process, and in particular with impulsive commuters in [25].
Following the clinical psychology literature (see [26]), impulsive commuters have been introduced in the analysis of binary choices with externalities in [25,27] when considering commuters whose switching rate only depends on the sign of the difference between payoffs, no matter how much they differ.This approach has been used to consider choices both in small and in large groups in [28] and also when considering the introduction of a third choice which dramatically changes the dynamics in terms of complexity (as analyzed in [29]).
Analyzing the Braess paradox in terms of a ternary choice game shows new interesting dynamical characteristics that are investigated in [30], with a particular interest in the coexistence of several equilibria.Nevertheless, as illustrated in [22,31], considering only impulsive commuters is not sufficient to describe the dynamics observed in experiments with human participants.Furthermore, as impulsive commuters consider only the sign and not the size of difference between costs, the population dynamics does not depend on the cost functions as long as the indifference point remains the same.In this paper, we consider a different behavior suggested by Amnon Rapoport (We are grateful to him for this helpful suggestion.) and which was used in [22] for artificial commuters.Although the full analysis of a homogenous-yet differentpopulation seems to provide a limited contribution, it may be a step forward to analyze the aggregate decision behavior in social dilemmas.In fact, in order to analyze heterogeneous populations, it is important to well understand the dynamics properties of component behaviors.In particular, we consider commuters which are concerned not only about the sign difference in payoffs but also on the relative difference.This kind of behavior is similar to the one considered in [32], where the propensity to switch choice is modulated by the difference between payoffs.Unlike the impulsive adjustment process, which makes the commuters change their choice as soon as a better choice occurs regardless of the difference, we consider a decision strategy which prescribes a change to the best available choice proportionally to the reported difference.Intuitively, this strategy seems to be more robust.The main result of the present work is that it is in fact robust.By contrast to the strategy considered in [30], which may lead to a stable cycle of any period, the strategy considered in this paper leads to a globally attracting fixed point.Depending on the parameters, this unique fixed point may be locally stable or unstable.However, the trajectories are convergent, in a few steps, to the fixed point.This result is rigorously proved for the case of a binary choice problem.For the ternary choice problem an analogous result is evidenced as well.
The plan of the work is as follows.In Section 2 the formalization of the dynamic model is reported.Section 2.1 includes the detailed description of the case with only two roads, which is represented by a one-dimensional piecewise smooth continuous map.We prove the existence of a unique fixed point, which may be locally stable or unstable in one partition.We prove that in any case it is globally attracting, that is, all the trajectories are ultimately converging to the fixed point.The case extended to three roads is considered in Section 3 and it is reduced to a two-dimensional piecewise smooth discontinuous map.We prove the existence of a unique fixed point, which may be locally attracting or not.We have only numerical evidence that also in this more general case, the fixed point is globally attracting.This can be rigorously proved for the particular cases in which the fixed point belongs to the boundaries of the domain of interest.The last section is devoted to the conclusions.

The Dynamic Model with Two Roads
The Braess paradox can be illustrated by Figure 1 as follows.Assume there is a unitary mass of commuters from start () to end () and there are two roads: one passing through left () and the other through right ().The cost of each road is given by the sum of the time spent along each segment.In this network, segments - and - do not depend on traffic and they cost   and   , respectively.On the contrary, time spent along segments - and - is proportional to the number of travellers and therefore, they cost   (1 − ) and   , where  ∈ [0, 1] is the fraction of the population using segment -.At the Nash equilibrium commuters are distributed in such a way that both roads (-- and --) have equal cos;, that is, a fraction (  +  −  )/(  +  ) of commuters will choose -- and a fraction (  +   −   )/(  +   ) will choose --.For example, assume as in [22] that  :=   =   = 27 and  :=   =   = 24.Then, the symmetry of costs makes the population to split exactly into two equal fractions at the Nash equilibrium ((  +   −   )/(  +   ) = 1/2), so that the travel time for both roads is 24(1/2) + 27 = 39.Now we assume that a very fast road is built connecting  to  at cost  = 3.As we will see in Section 3, at the new Nash equilibrium commuters are distributed in such a way that the three roads (--, ---, and --) have equal cost; that is, a fraction ( +   −   )/  of commuters will choose --, a fraction ( +   −   )/  will choose --, and the rest will choose ---.In the numerical example, this means that the entire population will choose --- (since in the other two roads the fraction of commuter is ( +  − )/ = 0) with a total travel cost of   +   +  = 51.According to [19], this is considered paradoxical as it shows how adding extra capacity to a network can reduce overall performance.More correctly, it is just counterintuitive and the mathematical reason is that there is a distinction between Nash equilibria and optima.
We consider the original network first made of two roads only (i.e., without the link -) as in Figure 1(a).
As in [24] this process can be modeled as a discrete time dynamical system considering commuters facing a binary choice between paths -- and --.For the sake of brevity these paths will be denoted as  and , respectively.To this Figure 1: Basic network with the addition of the link from  to  in (b) and without in (a).
purpose, assume the set of commuters is normalized to the interval [0, 1].At each time period  ≥ 0,    ≥ 0 indicates the fraction of commuters choosing  and    ≥ 0 the fraction of those choosing , given by    = 1 −    .Therefore, the travel times are given by where   ,   ,   ,   > 0 and can be written as ( This way, the travel times on the two roads are equal (and the commuters are indifferent) when (  ) = (  ); that is, when   =  * , where We say that the threshold  * is feasible when  * ∈ [0, 1].However,  * = 0 (resp.,  * = 1) clearly corresponds to the case in which the whole population chooses action  (resp., ), and we shall see that this is indeed satisfied in the model described in the next subsection.We obtain the following constraints on the parameters in order to have  * ∈ (0, 1), which we assume henceforth 2.1.The One-Dimensional PWS Map and Its Dynamics.
Commuters are homogeneous and at each period decide their strategy considering the previous period travel costs assuming they will remain the same.At time  + 1 the fraction    is common knowledge and each commuter observes the respective travel costs either (   ) or (   ), depending on their choice.The commuters decide their future action at time  + 1 comparing the costs (   ) and (   ).We assume the commuters are nonimpulsive and myopically minimize their costs.That is, they change strategy proportionally to the difference between their chosen road and the best one, where the best road is the fastest.We introduce parameters   ∈ (0, 1) and   ∈ (0, 1) as switching rates, that is, the propensity for moving either to  or to , respectively.With nonimpulsive commuters these rates are adjusted by the normalized difference of travel costs.The difference (   ) − (   ) is normalized by the largest value of this difference, denoted by  1 and obtained in correspondence of    = 0. Therefore we have  1 = (0) − (0) =   +   −   as already introduced in (4).Thus commuters are switching road proportionally to the side of the payoff difference.Similarly we can give a reason with respect to the difference (   ) − (   ) to get a normalizing value.Now the largest value is obtained in correspondence of    = 0; that is,    = 1, and we get  2 = (1)−(1) =   +  −  as already introduced in (4).
The resulting dynamics is ( Substituting from ( 2) and rearranging we obtain From the definition of  * given in (3), it can also be written as at which we have ( * ) = ( * ), it is also   ( * ) =   ( * ) and thus  is continuous in  * and it is a fixed point as ( * ) =  * .We have the following proposition.
Proof.Only the uniqueness is left to prove.The equation   (  ) =   has two solutions:   =  * and   = 1 which is larger than  * and thus a virtual fixed point.The equation   (  ) =   has two solutions:   =  * and   = 0 which is smaller than  * and thus a virtual fixed point.Thus, the unique solution is   =  * .
Clearly the fixed point may be locally stable or instable, depending on the slopes of the functions on the right and left sides of  * .However, we shall see that in any case it is globally attracting.That is, any i.c. in the interval [0, 1] has a trajectory which converges to  * .Proposition 2. The fixed point  * =  1 /(  +   ) ∈ (0, 1) is globally attracting.
Proof.Even if (  ) is not smooth in its fixed point (as indeed  * is a kink point of this map), the two components   (  ) and   (  ) are smooth in  * so that the left and right side derivatives of (  ) in  * are well defined: We have while From we have that on the left side of the fixed point the function is convex, while on the right side of the fixed point the function is concave.Notice that  2 / 1 only depends on   ,   ,   ,   , and it is positive under our assumptions.Depending on the values of the ratio  2 / 1 we can classify the right/left stability of the fixed point  * .From ( 9) we clearly have always    ( * ) < 1; thus the stability/instability on the left side of the fixed point depends on the condition    ( * ) > −1, which holds if and only if Similarly, from (11) we clearly have always    ( * ) < 1, and the stability/instability on the right side of the fixed point depends on the condition    ( * ) > −1, which holds if and only if And clearly we have the following sequence of inequalities (to be used below): To investigate the local stability of the fixed point we consider three intervals for  2 / 1 : In case (i) it is    ( * ) ≤ −1, moreover, it is easy to see that for any   ∈ [ * , 1] it is    (  ) <    ( * ) and thus the function on the right side of the fixed point is strictly decreasing and expansive: each point on the right side of the fixed point is mapped to the left side of the fixed point in one iteration.While on the left side of the fixed point the convex function   (  ) has    ( * ) = 1 −   ( 2 / 1 ) > 0 (as this holds for  2 / 1 < 1/  which is satisfied in this interval).This implies that the point of local minimum on the left side, say   , , is smaller than the fixed point,   , <  * .Then the fixed point is unique and the map is a contraction in the interval   loc = [  , ,  * ], and an absorbing interval which is mapped into   loc in one iteration is given by . Any initial condition belonging to [0, 1] \  has a trajectory which is mapped into  in a finite number of iterations.Thus  * is globally attracting.An example is shown in Figure 2(a).
Similarly we can reason when  2 / 1 belongs to the third interval.In fact, in case (iii) it is    ( * ) ≤ −1, moreover, it is Figure 2: Qualitative shapes of the map.In (a) case (i), when 0 <  2 / 1 ≤   /2, the fixed point is locally unstable on the right side.In (b) case (iii), when 2/  ≤  2 / 1 , the fixed point is locally unstable on the left side.When  2 / 1 belongs to the interval in (ii),   /2 <  2 / 1 < 2/  , we have that the fixed point is locally stable on both sides.Moreover, inside this interval we can distinguish three regions, as already showed in (15), that is: We notice that in Proposition 2 we prove that when the fixed point  * is internal to the interval [0, 1] then it is globally attracting.Let us turn to comment the two extrema, which occur when  * = 0 or  * = 1.These solutions clearly exist and are also globally attracting.In fact, the case  * = 0 corresponds to  1 = (0)−(0) =   +  −  = 0 and only the function   (  ) is applied in the interval [0, 1] and from the concavity of the function we have that this fixed point is globally attracting even if the eigenvalue is equal to 1.The other case  * = 1 corresponds to  2 = (1)−(1) =   +  −  = 0, and only the function   (  ) is applied in the interval [0, 1] and from the convexity of the function we have that this fixed point is globally attracting even if the eigenvalue is equal to 1.

The Dynamics in the Expanded Network with Three Roads
As it is well known, the Braess paradox introduces a new link and shows how this opportunity worsens both the individual and collective payoffs.This link introduces a new alternative: now the commuters are facing three choices, where the new one consists of path --- (see Figure 1(b)), which will be denoted as  in the following.Models with three choices were introduced in [29] as it concerns discrete time and [33] as it concerns continuous time.In this paper we analyze the dynamics when the travel time  for the new resulting link varies in a range that makes this link a dominant choice for some values and a dominated choice for others.It is worth to observe that in particular when the travel time on link - is zero, the paradoxical result still holds.Now assume that commuters switch road whenever travel time has become larger; that is, the other road is less costly and therefore more attractive.We indicate by   ≥ 0 the fraction of population choosing action , by   ≥ 0 the fraction choosing action , and by   ≥ 0 the fraction choosing action , with the constraint   +   +   = 1.The travel times are given, respectively, as By using the constraint let us define the fraction of population choosing  as   = 1 −   −   ≥ 0, so to consider only two variables, x = (  ,   ) ∈ R 2 + , and the phase space is the triangle After substituting the expression of   in the travel times we get The vertices of the phase space  *  (1, 0),  *  (0, 0), and  *  (0, 1) represent states in which the whole population chooses, respectively, actions , , and .
Since commuters are interested in minimizing travel time, we denote by   the region in which the choice  (where  is , , or ) is preferable.These regions are called dominance regions of .We have the following definition of the dominance regions: By using the expressions in (18) we get the following definitions for the regions where we have introduced The boundaries of the three regions are given by segments of straight lines of equations and it is immediate to see that the point x * = ( *  ,  *  ) satisfies also the third equation; that is, it belongs to all the three straight lines, x * ∈   for  = 1, 2, 3.
Using the geometric representation in the triangle  2 the dominance regions are illustrated in Figure 4 (via an example) using different colors.Three cases are shown, for different values of the parameter , in order to illustrate how the region   depends on the parameters of the third branch.
The point x * = ( *  ,  *  ) is the unique point on the boundaries   of all the three regions.Thus for our model we have to require  *  ≥ 0,  *  ≥ 0, and  *  +  *  ≤ 1, leading to  *  = 1 −  *  −  *  .In order to have three regions in  2 it must be  *  > 0,  *  > 0, and  *  +  *  < 1.The equality in one of these three conditions implies the disappearance of one region.For example, when  *  = 0, then 0 ≤  *  ≤ 1 and  *  = 1 −  *  , leaving only the two regions   and   and so on.
The conditions  *  ≥ 0,  *  ≥ 0, and  *  +  *  ≤ 1 lead to the constraints that will be assumed satisfied henceforth: We notice that from the third condition in (23) we have the values of  for which the third region is really present in  2 ; that is: Commuters are homogeneous and minimize their next period travel cost.At time +1 the vector x  becomes common knowledge, and each commuter can observe the travel costs (x  ), (x  ), and (x  ).We assume that if at time  a fraction    chooses path , a fraction    chooses action  and travel costs are such that (x  ) < (x  ) and (x  ) < (x  ), then both a fraction of the    commuters who chose action  and a fraction of the (1 −    −    ) commuters who chose action  will switch to path  in the next time period  + 1.The fraction of switching commuters is given by the switching propensities   ,   ,   modulated by the relative differences in payoffs.This happens whenever a path gives a smaller travel cost.In other words, at any time  all the commuters decide their future action at time  + 1 comparing the costs (x  ), (x  ), and (x  ).As in the one-dimensional case, here also the differences of travel costs are normalized dividing each difference by the constants giving the related maximum value, given in the different cases as follows: The resulting dynamics are described by a two-dimensional map x +1 = F(x  ) defined as where By construction we have that F maps  2 into itself.In fact, to show that F : +1 ≥ 0, and +1 ≥ 0, and   +1 ≥ 0; thus (  +1 ,   +1 ) ∈  2 .Substituting from (18) we can rewrite the functions in explicit form as Differently from the one-dimensional map  considered in the previous section, the two-dimensional map F is not continuous in  2 .More precisely, the functions F  , F  , and F  are continuous, and thus F is continuous in the interior of each region in which the different definitions apply.However, in general, except for the point x * , the map F is not continuous along the borders   ,  = 1, 2, 3, of the regions   ,   , and   .In fact, it is easy to see that considering Proof.The proof of this proposition follows directly from the observation that One way is already proved as we have detected the fixed point starting from the solution of (x) = (x) and (x) = (x), showing that it is the unique point x * .Vice versa, let us look for the solutions of F(x) = x.We have the following systems (where   = 1 −   −   ): or, equivalently (we recall that   ,   , and   are different from zero), Considering the equation F  (x) = x, we see that it is certainly satisfied for   = 0 and   = 0, which leads to the corner point with   = 1.However, if the fixed point is an interior point of  2 then the point (1, 0) does not belong to the proper region   ; that is, it is a virtual fixed point.Clearly this equation is satisfied when (x) = (x) and (x) = (x), which occurs only at the point x * .It is possible to have x * = (1, 0) and this occurs for (  − )/  = 0 and (  − )/  = 1.
Thus we can state that the only solution of F  (x) = x in   is given by the fixed point x * .Similarly we can reason in the other regions.
It is worth to mention that particular cases are obtained when the fixed point x * belongs to a boundary of the region  2 .For example, when  *  +  *  = 1 and  *  = 0, then only the two regions   and   are involved.This occurs when the parameters satisfy From the maps F  and F  in (27) and for the parameters occurring in this case, it can be seen that   +1 = 1−  +1 holds in both, so that the dynamics can be studied by using only the variable    and the resulting one-dimensional map is as follows: which corresponds to the system already studied in Section 2.
As we have seen, this fixed point is globally attracting, even if locally we can have the eigenvalue on some side larger than 1 in modulus.
The case with  *  = 0, so that 0 ≤  *  ≤ 1 and  *  = 1 −  *  , leaves only the two regions   and   .This occurs when the parameters satisfy 0 ≤ (  − )/  ≤ 1, (  − )/  = 1.From the maps F  and F  in (27) it can be seen that    converges to  *  = 0 so that the resulting asymptotic dynamic behavior can be studied via the onedimensional map given by   +1 = (   ) similar to the one obtained in (37) with obvious changes.
By using arguments as in Section 2, it can be shown that these one-dimensional systems have a unique fixed point which is globally attracting (although it can be locally stable or unstable).
In order to study the local stability of the fixed point of the two-dimensional map F, we can use the linearization of the different definitions in the fixed point, which leads to the following Jacobian matrices, one for each region   ,   , and   , that we denote, respectively, with   ,   , and   : ) , ) . ( The two real eigenvalues of the Jacobian matrix in   are in explicit form and both are smaller than +1.However, they can be larger than −1 or not.Also the eigenvalues of the other jacobian matrices can be in modulus smaller or larger than 1.However, the global dynamics observed numerically give always trajectories which are convergent to the fixed point x * , at any set of allowed parameters values.This global attractivity in the two-dimensional map is difficult to be proved rigorously; however the results in the particular cases commented above, that is, when the fixed point x * belongs to the boundary of  2 , suggests that the same result is true also when the fixed point is in the interior of  2 . In Figure 6 we show some examples: in Figure 6(a) we can see a trajectory starting at   ; in Figure 6(b) a trajectory whose initial point in   is mapped into   .The shape of the functions in the case of Figure 6(b) is similar to the one shown in Figure 5.

Conclusion
In this paper we have analyzed a dynamical version of the Braess paradox with nonimpulsive commuters, who change road proportionally to the cost difference.We were interested to prove that with nonimpulsive commuters there exists a unique equilibrium both in the original network with two choices and in the ternary one, when a single link is added.We have shown that both models are quite robust.We were able to provide an analytical proof of the global attractivity of the unique fixed point in the one-dimensional case, when only two roads are available and we used numerical techniques and simulations to give evidence in the two-dimensional case (i.e., when a new road is added), as a rigorous proof can be done only for particular border cases.
A limitation of our contribution is considering homogeneous populations in spite of the fact that the evidence supports heterogeneity.Nevertheless, heterogeneity of commuters' behavior cannot be easily classified; yet, even when conducting experiments, common individual patterns are just identified and classified.On the other hand, when observing the aggregate behavior, in many cases the literature provides evidence in support of the paradox outcome, that is, the convergence to the Nash equilibrium.The impulsive agents in [30] react faster than the proportional agents presented in this paper; yet, as a population they fail to achieve the Nash equilibria in certain cases, while in this paper the aggregate behavior does not.We proposed this aggregate behavior because it replies the convergence to the Nash equilibria and at the same time it may be the result of modeling some observed individual behaviors, such as imitation and free riding.
Taking into account the limitation of homogeneous population analysis, a natural extension of our contribution is considering heterogeneous populations with both impulsive and nonimpulsive commuters.We have reasons to believe that in such a case some properties of the different behaviors are inherited and some are lost.Therefore the results we provide in this paper match those for impulsive populations and are paramount to extend the analysis to more realistic cases.In fact-as the empirical results show-heterogeneous populations dynamics provide a better fit of what has been observed when considering human participants interaction.
Furthermore, it will be interesting to consider generalizations to networks with richer architectures.Finally, we observe that, since with the class of behavior we consider in this paper that dynamics depends on the shape of the cost functions, it will be interesting to extend the analysis to nonlinear cost functions.

Figure 3 :
Qualitative shapes of the map in case (ii), when   /2 <  2 / 1 ≤ 2/  and the fixed point is locally stable on both sides.) and thus the function on the left side of the fixed point is strictly decreasing and expansive: each point on the left side of the fixed point is mapped to the right side of the fixed point in one iteration.While on the right side of the fixed point the concave function   (  ) has    ( * ) = 1 −   ( 1 / 2 ) > 0 (as this holds for  2 / 1 >   which is satisfied in this interval).This implies that the point of local maximum on the right side, say easy to see that for any   ∈ [0,  * ] it is    ( * ) <    ( * , , is larger than the fixed point,   , >  * .Then the map is a contraction in the interval   loc = [ * ,   , ], and an absorbing interval which is mapped into   loc in one iteration is given by  = [ −1  (  , ),   , ] when   (0) =   >   , , or  = [0,   , ] when   (0) =   ≤   , .Any initial condition belonging to [0, 1] \  has a trajectory which is mapped into  in a finite number of iterations.Thus  * is globally attracting.An example is shown in Figure 2(b).
2/  with −1 <    ( * ) < 0 and 0 <    ( * ) < 1, as in Figure3(c).In case (a) we have that the point of local minimum on the left side, say   , , is smaller than the fixed point,   , <  * .Then the map is a contraction in the interval   loc = [  , ,  * ], and on the right side the map is decreasing, so that an absorbing interval which is mapped into   loc in one iteration is given by  = [  , ,  −1  (  , )] when   (1) = 1−  <   , , or  = [  , , 1] when   (1) = 1−  ≥   , .Any initial condition belonging to [0, 1] \  has a trajectory which is mapped into  in a finite number of iterations.Thus  * is globally attracting.In case (c) we can reason similarly, we have that the point of local maximum on the right side, say   , , is larger than the fixed point,   , >  * .Then the map is a contraction in the interval   loc = [ * ,   , ], and on the left side the map is decreasing, so that an absorbing interval which is mapped into   loc in one iteration is given by  = [ −1  (  , ),   , ] when   (0) =   >   , , or  = [0,   , ] when   (0) =   ≤   , .Any initial condition belonging to [0, 1] \  has a trajectory which is mapped into  in a finite number of iterations.Thus  * is globally attracting.In case (b) we have that the point of local minimum on the left side, say   , , is smaller than the fixed point,   , <  * and also that the point of local maximum on the right side, say   , , is larger than the fixed point,   , >  * .Then the map is a contraction in the interval   or [0, 1], depending under obvious conditions on the values of   and   .When  ⊂ [0, 1] then any initial condition belonging to [0, 1] \  has a trajectory which is mapped into  in a finite number of iterations.Thus  * is globally attracting.