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
Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions.
Power analysis of voting by count and account
Using players’ Shapley–Shubik power indices, Peleg [4] proved that voting by count and account is more egalitarian than voting by account. In this paper, we show that a stronger shift in power takes place when the voting power of players is measured by their Shapley–Shubik indices. Moreover, we prove that analogous power shifts also occur with respect to the absolute Banzhaf and the absolute Johnston power indices.
Problems with classical models of sex-ratio evolution
The classical theory of the sex-ratio evolution, known as the sex-ratio game, is based on the maximization of the number of grandchildren, treated as a fitness measure of a female producing offspring of the sex ratio that is coded in her genes. The theory predicts that it is more profitable to produce offspring with less numerous sex. We can find in the literature mutually exclusive conclusions based on this prediction: some textbooks say that populations with the equal number of sons and daughters...
Production games, core deficit, duality and shadow prices
Considered here are production (or market) games with transferable utility. Prime objects are explicitly computable core solutions, or somewhat "deficit" versions of such, fully defined by shadow prices. Main arguments revolve around standard Lagrangian duality. A chief concern is to relax, or avoid, the commonplace assumption that all preferences and production possibilities be convex. Doing so, novel results are obtained about non-emptiness of the core, and about specific imputations therein.