We analyze reputation effects in two-player repeated games of strictly conflicting interests. In such games player 1 has a commitment action such that a best reply to it gives player 1 the highest individually rational payoff and player 2 the minmax payoff. Players have equal discount factors. With positive probability player 1 is a type who chooses the commitment action after every history. We...

Borwein and Mossinghoff investigated the Rudin-Shapirolike polynomials, which are infinite families of Littlewood polynomials, that is, polynomials whose coefficients are all in {−1, 1}. Each family of Rudin-Shapiro-like polynomials is obtained from a starting polynomial (which we call the seed) by a recursive construction. These polynomials can be regarded as binary sequences. Borwein and Moss...

This paper considers the shortest path problem on directed acyclic graphs, where the uncertainty of input data (lengths of arcs) is modeled in the form of intervals. In order to handle the interval data the minmax criterion to the regret values is applied, where the original objective function with interval coefficients is transformed into that of finding the least maximum worst-case regret, wh...

This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distan...

This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distan...

We study the relationship between a player’s minmax payoff and his lowest equilibrium payoff (his reservation utility) in repeated games with imperfect monitoring. We provide a necessary and sufficient condition on the information structure under which these two payoffs coincide for any payoff matrix. Under a full rank assumption, we further show that, if the monitoring structure of an infinite...

Three new algorithms based on minimization of autocorrelation of transmitted symbols and the SLM approach which are computationally less demanding have been proposed. In the first algorithm, autocorrelation of complex data sequence is minimized to a value of 1 that results in reduction of PAPR. Second algorithm generates multiple random sequences from the sequence generated in the first algorit...

Glossary AR(1): Autoregressive model of order one. The present state of a system can be described as a linear function of the state at the previous time, plus timeindependent noise. data assimilation: Method of optimally combining irregularly spaced observations with dynamical constraints to produce dynamically consistent fields on regular grids. CCA: Canonical Correlation Analysis EOF: Empiric...