We study a variant of the repeated prisoner’s dilemma with uncertain horizon, in which each player chooses his foresight ability; that is, the timing in which he is informed about the realized length of the interaction. In addition, each player has an independent probability to observe the opponent’s foresight ability. We show that if this probability is not too close to 0 or 1, then the game a...

We study the entanglement game, which is a version of cops and robbers, on sparse graphs. While the minimum degree of a graph G is a lower bound for the number of cops needed to catch a robber in G, we show that the required number of cops can be much larger, even for graphs with small maximum degree. In particular, we show that there are 3-regular graphs where a linear number of cops are needed.

This paper shows the "Sequential PrQjection Algorithm" application results, originated by the Bell System [1] and [2], forecasting the yearly representative traffic" values (YRV*) of III different route types of four years data (1983-1986), one step ahead. A seasonal algorithm using monthly data (MRV*) [3], will support the former, however, requiring an exact determination of parameters to succ...

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential insta-bilities. We present an implementation of a look-ahead version of the Lanczos algorithm which overcomes these problems by skipping over th...