New versions and extensions of Benson’s outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each iteration rather than two or three as in previous...

We use a genetic algorithm to simulate the evolution of error-prone finite automata in the repeated Prisoner’s Dilemma game. In particular, the automata are subjected to implementation and perception errors. The computational experiments examine whether and how the distribution of outcomes and...

В статье разработана экономико-экологическая модель оптимального управления системой обращения с твердыми отходами на региональном уровне, определены ее...

В работе рассматривается непрерывный вариант игры НИМ, в которой два игрока по очереди зачерпывают воду из какой-то емкости. Выигрывает игрок, сделавший это...

The article develops an economic and ecological model of optimal management of the system of solid waste disposal at the regional level, identifies its target functions and forms optimisation scenarios of management of this sphere with theoretically optimal parameters' values. Based on the model...

We discuss how trade-in rebates can be used to manage product multigenerational innovation diffusion waves, and study the optimal behavior of the firm controlling the prices and rebates associated to product upgrades. We show how this strategy accelerates the diffusion and can lead to profit...

The semigroup game is a two-person zero-sum game defined on a semigroup <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${(S,\cdot)}$$</EquationSource> </InlineEquation> as follows: Players 1 and 2 choose elements <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${x \in S}$$</EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$${y \in S}$$</EquationSource> </InlineEquation>, respectively, and player 1 receives a payoff f (x y) defined by a function f : S → [−1, 1]. If the semigroup is amenable...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation>