<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510810314</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083439.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20130301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1134/S106423071302007X</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1134/S106423071302007X</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Controlling the order of moves in voting by veto. II. Algorithms for constructing an optimal order of moves</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[A. Mashechkin, N. Novikova]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The study of issues concerning collective decision-making in complex systems using voting by veto is continued. A dedicated player is assumed to exist in the collective that forms the order of voting (order of moves) for the other participants. The problem of searching for the control strategy for the order of moves that ensures the win of alternative 1 that is preferable for the dedicated player is studied for the previously unstudied cases when such an order of moves exists. In particular, an algorithm for constructing such an order is proposed for the case when there is another participant for which alternative 1 is higher than the fourth from the end and when there is a group of participants that are relatively well-disposed to alternative 1 (more precisely, this alternative is higher than the third from the end for them). It is shown that the preference order of the alternatives that are better than alternative 1 is of no importance for the problem under consideration. It is proved that the conditions for the participants' preferences that are sufficient for the existence of the desired order of moves (they were obtained in the first part of this paper) are unimprovable.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Pleiades Publishing, Ltd., 2013</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Mashechkin</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Moscow State University, 119991, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Novikova</subfield>
   <subfield code="D">N.</subfield>
   <subfield code="u">Moscow State University, 119991, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Computer and Systems Sciences International</subfield>
   <subfield code="d">SP MAIK Nauka/Interperiodica</subfield>
   <subfield code="g">52/2(2013-03-01), 186-214</subfield>
   <subfield code="x">1064-2307</subfield>
   <subfield code="q">52:2&lt;186</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">52</subfield>
   <subfield code="o">11488</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1134/S106423071302007X</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1134/S106423071302007X</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Mashechkin</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Moscow State University, 119991, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Novikova</subfield>
   <subfield code="D">N.</subfield>
   <subfield code="u">Moscow State University, 119991, Moscow, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of Computer and Systems Sciences International</subfield>
   <subfield code="d">SP MAIK Nauka/Interperiodica</subfield>
   <subfield code="g">52/2(2013-03-01), 186-214</subfield>
   <subfield code="x">1064-2307</subfield>
   <subfield code="q">52:2&lt;186</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">52</subfield>
   <subfield code="o">11488</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
