Search

A method is proposed to support management policy design and verification in complex cyber-physical & human systems (CPHS). A hierarchy of interconnected formal models is built to provide the multi-faceted view of the conflict situation lying in the core of a certain management problem. Game-theoretical analysis reveals the problem and mechanism design suggests the alternative management policy. Its efficiency is verified by multi-agent simulations and gaming experiments with experts. The approach is illustrated using the examples of two market manipulation issues arising on the Russian wholesale electricity market.

Barberá, Massó and Serizawa (1998) provided full characterization for class of strategy-proof social choice functions for societies where the set of alternatives is any full dimensional compact subset of a Euclidean space and all voters have generalized single-peaked preferences. They proved that this class is composed by generalized median voter schemes satisfying an additional condition, called the “intersection property”. But according to their results in order to understand whether any generalized median voter scheme satisfies intersection property for given set of alternatives or not it was necessary to check all the alternatives from the set of unfeasible alternatives – addition of the set of feasible alternatives to minimal Cartesian product range, containing this set. So the number of alternatives to be checked, was infinite. In this paper it is proved, that it is enough to check finite number of alternatives from the set of unfeasible alternatives and constructive algorithm to determine alternatives that should be checked is provided.

For the one-agent active system with internal uncertainty and asymmetric information, the incentive problem regarded as the exchange scheme was solved using the principle of open control, that is, constructing an incentive mechanism with revelation of information, where revelation of the true parameters of income function is the dominant agent's strategy.