Pavel Chebotarev
Àvtomatika i Telemekhanika  
S     Russian version

Pavel Chebotarev

Associate Editor

Doctor of Sciences, Head of the Laboratory on Mathematical Methods in Multiagent Systems, Institute for Control Sciences of the Russian Academy of Sciences, Moscow, Russia; Prof. of Moscow Inst. of Physics and Technology (part-time).

Professional Membership:

Member of Editorial Board of the Journals "Automation and Remote Control", "Control Problems" (in Russian), "Control in Large-Scale Systems" (on-line journal, in Russian)

Publications: 170 papers in journals, proceedings volumes, etc.

Areas of Interest:
  • Algebraic / spectral graph theory
  • Multiagent systems
  • Decision making
  • Aggregation of information
  • Data analysis
Selected Publications:
  • Agaev R.P., Chebotarev P.Y. Models of latent consensus // Autom. Rem. Control., 2017.
  • K. Avrachenkov, P. Chebotarev, A. Mishenin. Semi-supervised Learning with Regularized Laplacian // Optimization Methods and Software. 2016.
  • P. Chebotarev, R. Agaev. The forest consensus theorem // IEEE Transactions on Automatic Control. 2014. V.59. No. 9. P. 2475–2479.
  • P. Chebotarev, M. Deza. A topological interpretation of the walk distances / Distance Geometry: Theory, Methods, and Applications, ed. by A. Mucherino, C. Lavor, L. Liberti, and N. Maculan. – Berlin: Springer, 2013, Chapter 7. P. 121–135.
  • P. Chebotarev, R. B. Bapat, R. Balaji. Simple expressions for the long walk distance // Linear Algebra and its Applications. 2013. V.439. No.4. 893–898.
  • P. Chebotarev. The walk distances in graphs // Discrete Applied Mathematics. 2012. V. 160. No. 10-11. P. 1484-1500.
  • R. P. Agaev, P. Yu. Chebotarev. The projection method for reaching consensus and the regularized power limit of a stochastic matrix // Automation and Remote Control. 2011. V. 72. No.12. P. 2458–2476.
  • P. Chebotarev. A class of graph-geodetic distances generalizing the shortest-path and the resistance distances // Discrete Applied Mathematics. 2011. V. 159. No. 5. P. 295–302.
  • P. Chebotarev. The graph bottleneck identity // Advances in Applied Mathematics. 2011. V. 47. No. 3. P. 403–413.
  • P. Chebotarev. Comments on “Consensus and Cooperation in Networked Multi-Agent Systems” // Proceedings of the IEEE. 2010. V. 98. No. 7. 1353–1354.
  • R. Agaev, P. Chebotarev. Which digraphs with ring structure are essentially cyclic? // Advances in Applied Mathematics. 2009. V. 45. No. 2. P. 232–251.
  • P. Chebotarev. Spanning forests and the golden ratio // Discrete Applied Mathematics. – 2008. V. 156. No.5. 813–821.
  • P. Yu. Chebotarev, Analytical expression of the expected values of capital at voting in the stochastic environment, Automation and Remote Control, 2006, Vol. 67, No. 3, pp. 480–492.
  • V. I. Borzenko, Z. M. Lezina, A. K. Loginov, Ya. Yu. Tsodikova, and P. Yu. Chebotarev. Strategies of voting in stochastic environment: Egoism and collectivism // Automation and Remote Control, 2006, Vol. 67, No. 2, pp. 311–328.
  • R. Agaev, P.Chebotarev. On the spectra of nonsymmetric Laplacian matrices // Linear Algebra and Its Applications. 2005. V. 399. 157–168.
  • P. Chebotarev, R. Agaev. Forest matrices around the Laplacian matrix // Linear Algebra and Its Applications. 2002. V. 356. 253-274.
  • P. Chebotarev. On the extension of utility functions // Constructing and Applying Objective Functions. Lecture Notes in Economics and Mathematical Systems, Vol.510, Springer-Verlag, Berlin, 2002, P. 63-74.
  • R. P. Agaev, P. Yu. Chebotarev. Spanning forests of a digraph and their applications // Automation and Remote Control 62 (2001), No. 3, 443-466.
  • R. P. Agaev, P. Yu. Chebotarev. The matrix of maximum out forests of a digraph and its applications // Automation and Remote Control 61, No. 9, Part 1 (2000) 1424-1450.
  • P. Yu. Chebotarev, E. Shamis. Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures // Journal of the Franklin Institute, 336 (1999), No.2, 205-226.
  • P. Yu. Chebotarev, E. Shamis. Characterizations of scoring methods for preference aggregation // Annals of Operations Research, 1998. V. 80. P.299-332.
  • P. Yu. Chebotarev, E. V. Shamis. The matrix-forest theorem and measuring relations in small social groups // Automation and Remote Control, 58, No. 9, Part 2, 1505-1514 (1997).
  • P. Yu. Chebotarev. Aggregation of preferences by the generalized row sum method // Mathematical Social Sciences. – 1994. – V. 27. – P. 293–320.
  • P. Yu. Chebotarev. Generalization of the row sum method for incomplete paired comparisons. Automation and Remote Control, 50, No. 8, Part 2, 1103-1113 (1989).
  • P. Yu. Chebotarev. Some properties of paths in the dynamic voting problem. Automation and Remote Control, 47, No. 1, 121-126 (1986).

ICS RAS 2016