|
|
|
|
|
|
|
|
Straightforward elections, unanimity and phantom voters
: Border K. C. / Jordan J. S.
:
: 1983
:
: Review of Economic Studies
() : 1
: Vol. 50
: Border K., Jordan J.S. Straightforward elections, unanimity and phantom voters // Review of Economic Studies. 1983. Vol. 50. N 1. P. 153 170.
: Non-manipulable direct revelation social choice functions are characterized for societies where the space of alternatives is a euclidean space and all voters have separable star-shaped preferences with a global optimum. If a non-manipulable choice function satisfies a weak unanmity-respecting condition (which is equivalent to having an unrestricted range) then it will depend only on voters' ideal points. Further, such a choice function will decompose into a product of one-dimensional mechanisms in the sense that each coordinate of the chosen point depends only on the respective coordinate of the voters' ideal points. Each coordinate function will also be non-manipulable and respect unanimity. Such one-dimensional mechanisms are uncompromising in the sense that voters cannot take an extreme position to influence the choice to their advantage. Two characterizations of uncompromising choice functions are presented. One is in terms of a continuity condition, the other in terms of \phantom voters\, i.e. those points which are chosen which are not any voter's ideal point. There are many such mechanisms which are not dictatorial. However, if differentiability is required of the choice function, this forces it to be either constant or dictatorial. In the multidimensional case, non-separability of preferences leads to dictatorship, even if preferences are restricted to be quadratic.
: ( )
:
: /
: () : 8039, : 705
|
|
Theory of moves
: Brams S. J.
:
( ): Univ. of Cambridge
: 1995
:
: Brams S.J. Theory of moves. Cambridge: Univ. of Cambridge, 1995. 248 p.
:
:
: 5536, : 0
|
|
|
|
Problems of optimum distribution of resources
: Burkov V. N.
:
: 1972
: ..
: Control and Cybernetics
() : 1/2
: Vol. 1
: Burkov V.N. Problems of optimum distribution of resources // Control and Cybernetics. 1972. Vol. 1. N. 1/2. P. 27-41.
: The optimum distribution of a limited quantity of resources, is one of the most important trend in the theory of network planning and of control. Problems of an optimum distribution of resources, are in principle extremal problems of combinational type. At present there are no effective and accurate methods for the solution of such problems. A satisfactory developed theory exists only for the problems where ordering of the network events is assumed. The paper considers basic results and methods of optimum distribution of resources, when the network events are ordered.
.
. . , . .
Problemy optymalnego rozdziału ograniczonych zasobów są jednym z najważniejszych kierunków teorii sterowania i planowania sieciowego. Optymalny rozdział zasobów jest w zasadzie zagadnieniem ekstremalnym typu kombinatorycznego. Obecnie nie ma efektywnych i dokładnych metod rozwiązywania takich zagadnień. Wystarczająco opracowana jest jedynie teoria dotycząca zagadnień, w których zakłada się uporządkowanie zdarzeń sieci. W pracy niniejszej rozpatrzono
podstawowe wyniki i metody optymalnego rozdziału zasobów uzyskane przy założeniu, że zdarzenia sieci są uporządkowane.
:
:
:
: (pdf) : 9822, : 3627
|
|
Fairplay in control of active systems
: Burkov V. N. / Lerner A. .
:
( ): North-Holland Publishing Company
: 1971
:
: Differential games and related topics
: Burkov V.N., Lerner A. Ya. Fairplay in control of active systems / Differential games and related topics. Amsterdam, London: North-Holland Publishing Company, 1971. P. 164 168.
: Large-scale manmachine systems incorporate subsystems whose goals do not generally coincide with the of the system. A single man or a group of people make a subsystem actively maximize its objective function by reporting the information on its model (in other words on its potential) to an external control unit. Besides the subsystem has certain information on the strategy applied by the external control unit and by other subsystems and uses this information in its own interests. This lecture is concerned with control of such active systems that incorporate men and groups of people that are after their own goals. The control problem is to find an optimal plan for the system so that the subsystems plans be also optimal. A solution of the control problem based on the fair play principle is proposed. This principle largely recognizes the active nature of the subsystems.
: ( )
:
:
:
: (pdf) : (php) : 9498, : 1707
|
|
|
|
|
|
|
|
|
|
|
|
|
|