10 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- National Research University Higher School of EconomicsRU4 papers
- Russian Academy of SciencesRU3 papers
- Institute of Applied Mathematical Research of the Karelian Research Centre of the Russian Academy of Sciences1 paper
- Karelian Research CentreRU1 paper
- Qingdao UniversityCN1 paper
- Saint-Petersburg Institute of HistoryRU1 paper
6 papers
Minimal Envy and Popular Matchings
Aleksei Y. Kondratev, Alexander S. Nesterov
We study ex-post fairness in the object allocation problem where objects are valuable and commonly owned. A matching is fair from individual perspective if it has only inevitable e…
Measuring Majority Power and Veto Power of Voting Rules
Aleksei Y. Kondratev, Alexander S. Nesterov
We study voting rules with respect to how they allow or limit a majority from dominating minorities: whether a voting rule makes a majority powerful, and whether minorities can vet…
The Ranking Problem of Alternatives as a Cooperative Game
Aleksei Kondratev, Vladimir Mazalov
This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperat…
On repeated zero-sum games with incomplete information and asymptotically bounded values
Fedor Sandomirskiy
We consider repeated zero-sum games with incomplete information on the side of Player 2 with the total payoff given by the non-normalized sum of stage gains. In the classical examp…
A class of problems of NP to be worth to search an efficient solving algorithm
Anatoly D. Plotnikov
We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solu…
Designing SAT for HCP
Anatoly D. Plotnikov
For arbitrary undirected graph , we are designing SATISFIABILITY problem (SAT) for HCP, using tools of Boolean algebra only. The obtained SAT be the logic formulation of conditi…