Optimal token allocation in solitaire knock'm down.
Optimality conditions for a class of mathematical programs with equilibrium constraints: strongly regular case
The paper deals with mathematical programs, where parameter-dependent nonlinear complementarity problems arise as side constraints. Using the generalized differential calculus for nonsmooth and set-valued mappings due to B. Mordukhovich, we compute the so-called coderivative of the map assigning the parameter the (set of) solutions to the respective complementarity problem. This enables, in particular, to derive useful 1st-order necessary optimality conditions, provided the complementarity problem...
Optimalizace a diferenciální hry
Oscillations, quasi-oscillations and joint continuity.
Parameter optimization in nonzero-sum differential games
Pareto optimality in the kidney exchange problem
To overcome the shortage of cadaveric kidneys available for transplantation, several countries organize systematic kidney exchange programs. The kidney exchange problem can be modelled as a cooperative game between incompatible patient-donor pairs whose solutions are permutations of players representing cyclic donations. We show that the problems to decide whether a given permutation is not (weakly) Pareto optimal are NP-complete.
Parrondo's paradox.
Partial cooperation and convex sets.
We consider games of transferable utility, those that deal with partial cooperation situations, made up of coalition systems, in which every unit coalition is feasible and every coalition of players can be expressed as a disjoint union of maximal feasible coalitions. These systems are named partition systems and cause restricted games. To sum up, we study feasible coalition systems delined by a partial order designed for a set of players and we analyze the characteristics of a feasible coalition...
Partial Nim.
Payoff space in -games.
PDE-viscosity solution approach to some problems of large deviations
Periodicity and other structure in a colorful family of Nim-like arrays.
Permissive strategies : from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem of finding...
Permissive strategies: from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...
Pilesize dynamic one-pile Nim and Beatty's theorem.
Playing Nim on a simplicial complex.
Polarized category theory, modules, and game semantics.
Polyiamonds and polyhexes with minimum site-perimeter and achievement games.
Poset game periodicity.
Possible Classification of the Methods of Operational Research Applicable in the Field of Defense