RUS  ENG
Full version
PEOPLE

Gurvich Vladimir Alexander

Publications in Math-Net.Ru

  1. Ультраметрики, деревья, потоки и узкие места

    Mat. Pros., Ser. 3, 16 (2012),  75–88
  2. Stable Families of Coalitions for Network Resource Allocation Problems

    Contributions to Game Theory and Management, 4 (2011),  223–230
  3. Метрические и ультраметрические пространства сопротивлений

    Mat. Pros., Ser. 3, 13 (2009),  134–141
  4. Criteria for the nonemptiness of dual cores

    Dokl. Akad. Nauk, 352:2 (1997),  159–162
  5. Dual cores and influence functions

    Dokl. Akad. Nauk, 352:1 (1997),  18–22
  6. Extremal sequences with forbidden sums

    Dokl. Akad. Nauk, 340:6 (1995),  731–735
  7. Berge's conjecture holds for rotational graphs

    Dokl. Akad. Nauk, 332:2 (1993),  144–148
  8. Biseparated graphs are perfect

    Dokl. Akad. Nauk, 331:5 (1993),  541–545
  9. Cyclic bilinear forms of enumerated graphs

    Dokl. Akad. Nauk, 331:1 (1993),  11–13
  10. Rotational graphs without odd holes and antiholes

    Dokl. Akad. Nauk, 329:4 (1993),  411–415
  11. Completely separated and biseparated graphs

    Dokl. Akad. Nauk, 328:4 (1993),  427–430
  12. A eneralized Lovasz inequality for perfect graphs

    Uspekhi Mat. Nauk, 48:2(290) (1993),  175–176
  13. A solution of the Harer–Zagier equation

    Uspekhi Mat. Nauk, 48:1(289) (1993),  159–160
  14. Cellular perfect graphs

    Dokl. Akad. Nauk, 326:2 (1992),  227–232
  15. Bilinear forms of enumerated graphs

    Dokl. Akad. Nauk, 325:2 (1992),  221–226
  16. A density criterion for reciprocal bipartite cyclic game forms

    Dokl. Akad. Nauk, 323:3 (1992),  398–405
  17. Algebraic properties of influence functions

    Dokl. Akad. Nauk, 323:1 (1992),  19–24
  18. Positional structures and chromatic graphs

    Dokl. Akad. Nauk, 322:5 (1992),  828–831
  19. Informational extensions of game forms

    Dokl. Akad. Nauk, 322:3 (1992),  451–455
  20. Enumerated graphs and their bilinear forms

    Uspekhi Mat. Nauk, 47:4(286) (1992),  189–190
  21. Quasiconvex analysis on semilattices and absolutely defined matrices

    Dokl. Akad. Nauk SSSR, 319:1 (1991),  27–32
  22. Some properties of dense cyclic game forms

    Dokl. Akad. Nauk SSSR, 318:6 (1991),  1289–1294
  23. Criteria for nonrepetitiveness of truth functions

    Dokl. Akad. Nauk SSSR, 318:3 (1991),  532–537
  24. The Poisson distribution for the number of pairs of close points

    Dokl. Akad. Nauk SSSR, 316:3 (1991),  533–538
  25. The Gaussian distribution for sums of distances

    Dokl. Akad. Nauk SSSR, 316:2 (1991),  279–284
  26. Tight cyclic game forms

    Uspekhi Mat. Nauk, 46:2(278) (1991),  211–212
  27. Calculation of schemes by the algorithms “rudder” and “ladder”

    Dokl. Akad. Nauk SSSR, 314:6 (1990),  1316–1321
  28. A saddle point in pure strategies

    Dokl. Akad. Nauk SSSR, 314:3 (1990),  542–546
  29. A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of $(2\times k)$-bimatrix games

    Uspekhi Mat. Nauk, 45:4(274) (1990),  151–152
  30. Conditions of existence and uniqueness of a solution of problems of convex programming

    Uspekhi Mat. Nauk, 45:4(274) (1990),  145–146
  31. Quasi-linear set functions and absolutely defined matrices

    Avtomat. i Telemekh., 1989, no. 12,  113–117
  32. Some properties of influence functions

    Dokl. Akad. Nauk SSSR, 307:6 (1989),  1311–1317
  33. Elementary vectors in separable convex programming

    Dokl. Akad. Nauk SSSR, 307:5 (1989),  1059–1064
  34. Maps of surfaces and their schemes

    Dokl. Akad. Nauk SSSR, 305:6 (1989),  1298–1303
  35. A criterion and verification of the ergodicity of cyclic game forms

    Uspekhi Mat. Nauk, 44:1(265) (1989),  193–194
  36. Equilibrium in pure strategies

    Dokl. Akad. Nauk SSSR, 303:4 (1988),  789–793
  37. Extremal homogeneous hypergraphs. An estimate for the Zarankiewicz function, and a criterion for the nondegeneracy of the function $\mathrm{ex}$

    Dokl. Akad. Nauk SSSR, 303:3 (1988),  538–542
  38. Extremal homogeneous hypergraphs and a hypercombinatorial function

    Dokl. Akad. Nauk SSSR, 298:4 (1988),  792–797
  39. A stochastic game with complete information and without equilibrium situations in pure stationary strategies

    Uspekhi Mat. Nauk, 43:2(260) (1988),  135–136
  40. Cyclic games and an algorithm to find minimax cycle means in directed graphs

    Zh. Vychisl. Mat. Mat. Fiz., 28:9 (1988),  1407–1417
  41. On the maximal number of edges for a graph with $n$ vertices in which a given subgraph with $k$ vertices has no more than $l$ edges

    Dokl. Akad. Nauk SSSR, 293:1 (1987),  27–32
  42. The equivalence of the problems of circuit computation, optimal flows, and statical equilibrium

    Uspekhi Mat. Nauk, 42:6(258) (1987),  191–192
  43. Metric and ultrametric spaces of resistances

    Uspekhi Mat. Nauk, 42:6(258) (1987),  187–188
  44. The conditions of solubility by domination of concave $n$-person games

    Uspekhi Mat. Nauk, 42:2(254) (1987),  223–224
  45. On the theory of monotone schemes

    Dokl. Akad. Nauk SSSR, 289:4 (1986),  796–800
  46. The existence of nontrivial stable social choice functions

    Dokl. Akad. Nauk SSSR, 289:4 (1986),  788–792
  47. Calculation of networks and dual problems of convex programming

    Dokl. Akad. Nauk SSSR, 287:5 (1986),  1062–1067
  48. Some properties and applications of complete edge-colored graphs and hypergraphs

    Dokl. Akad. Nauk SSSR, 279:6 (1984),  1306–1310
  49. Kirchhoff's second law for optimal transport flows

    Dokl. Akad. Nauk SSSR, 276:4 (1984),  812–817
  50. Balanced flow in a multiterminal network

    Dokl. Akad. Nauk SSSR, 275:6 (1984),  1327–1331
  51. On the normal form of positional games

    Dokl. Akad. Nauk SSSR, 264:1 (1982),  30–33
  52. Balls in the Hamming metric space

    Dokl. Akad. Nauk SSSR, 264:1 (1982),  27–29
  53. Repetition-free Boolean functions

    Uspekhi Mat. Nauk, 32:1(193) (1977),  183–184
  54. The solvability of positional games in pure strategies

    Zh. Vychisl. Mat. Mat. Fiz., 15:2 (1975),  358–371
  55. On the theory of multistep games

    Zh. Vychisl. Mat. Mat. Fiz., 13:6 (1973),  1485–1500

  56. Торг с богами

    Mat. Pros., Ser. 3, 20 (2016),  23–55

© Steklov Math. Inst. of RAS, 2024