@inproceedings{4545,
  abstract     = {A stochastic game is a two-player game played oil a graph, where in each state the successor is chosen either by One of the players, or according to a probability distribution. We Survey Stochastic games with limsup and liminf objectives. A real-valued re-ward is assigned to each state, and the value of all infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that call he achieved by resolving the decisions of the first player. We present the complexity of computing values of Stochastic games and their subclasses, and the complexity, of optimal strategies in such games. },
  author       = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A},
  location     = {Rhodos, Greece},
  pages        = {1 -- 15},
  publisher    = {Springer},
  title        = {{A survey of stochastic games with limsup and liminf objectives}},
  doi          = {10.1007/978-3-642-02930-1_1},
  volume       = {5556},
  year         = {2009},
}

@inproceedings{4569,
  abstract     = {Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties to measure the “goodness” of an implementation. Using games with corresponding quantitative objectives, we can synthesize “optimal” implementations, which are preferred among the set of possible implementations that satisfy a given specification.
In particular, we show how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems. In this framework, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and the solution of games with both lexicographic mean-payoff and parity objectives (for liveness requirements). We present algorithms for solving both kinds of novel graph games.},
  author       = {Bloem, Roderick and Chatterjee, Krishnendu and Henzinger, Thomas A and Jobstmann, Barbara},
  location     = {Grenoble, France},
  pages        = {140 -- 156},
  publisher    = {Springer},
  title        = {{Better quality in synthesis through quantitative objectives}},
  doi          = {10.1007/978-3-642-02658-4_14},
  volume       = {5643},
  year         = {2009},
}

@article{517,
  author       = {Barton, Nicholas H},
  journal      = {Genetics Research},
  number       = {5-6},
  pages        = {475 -- 477},
  publisher    = {Cambridge University Press},
  title        = {{Identity and coalescence in structured populations: A commentary on 'Inbreeding coefficients and coalescence times' by Montgomery Slatkin}},
  doi          = {10.1017/S0016672308009683},
  volume       = {89},
  year         = {2008},
}