The folk theorem characterizes the (subgame perfect) Nash equilibrium payo¤s of an undiscounted or discounted in…nitely repeated game with fully informed, patient players as the feasible individually rational payo¤s of the one-shot game. To which extent does the result still hold when every player privately knows his own payo¤s ? Under appropriate assumptions (private values and uniform punishm...

We study the repeated congestion game, in which multiple populations of players share resources, and make, at each iteration, a decentralized decision on which resources to utilize. We investigate the following question: given a model of how individual players update their strategies, does the resulting dynamics of strategy profiles converge to the set of Nash equilibria of the one-shot game? W...

A new type of replenishment policy is suggested in an entropy order quantity model for a perishable product possessing fuzzy holding cost and fuzzy disposal cost. This model represents an appropriate combination of two component demand with discounted selling price, particularly over a finite time horizon. Its main aim lies in the need for an entropic cost of the cycle time is a key feature of ...

We study upper and lower bounds on the sample-complexity of learning nearoptimal behaviour in finite-state discounted Markov Decision Processes (mdps). We prove a new bound for a modified version of Upper Confidence Reinforcement Learning (ucrl) with only cubic dependence on the horizon. The bound is unimprovable in all parameters except the size of the state/action space, where it depends line...

Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a generalization of the branching-time logic Ctl which achieves robustness with respect t...

Inspired by the paper of de Alfaro, Henzinger and Majumdar [2] about discounted μ-calculus we show new surprising links between parity games and different classes of discounted games.