Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 1986, Issue 1, Pages 133–138 (Mi at4736)  
This article is cited in 2 scientific papers (total in 2 papers)

Simulation of Behavior and Intelligence

Some properties of paths in a dynamic voting problem

P. Yu. Chebotarev

Moscow
Full-text PDF (1186 kB) Citations (2)
Abstract: The McKelvy theorem [1] is extended to the case where in the voting in an «Election» game the «$k$-majority» procedure is used. Depending on the number of voters and the dimension of the space of programs the values of $k$ are determined with which the paths approach some specified region in this space.

Received: 20.02.1985
Document Type: Article
UDC: 65.012.122
Language: Russian
Citation: P. Yu. Chebotarev, “Some properties of paths in a dynamic voting problem”, Avtomat. i Telemekh., 1986, no. 1, 133–138
Citation in format AMSBIB
\Bibitem{Che86}
\by P.~Yu.~Chebotarev
\paper Some properties of paths in a dynamic voting problem
\jour Avtomat. i Telemekh.
\yr 1986
\issue 1
\pages 133--138
\mathnet{http://mi.mathnet.ru/at4736}
Linking options:
  • https://www.mathnet.ru/eng/at4736
  • https://www.mathnet.ru/eng/at/y1986/i1/p133
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024