output
19992019
most citedMinimal Envy and Popular Matchings

10 citations

6 papers

cs.GT2019★ 10 cited

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…

cs.GT2018★ 9 cited

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…

cs.GT2015★ 5 cited

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…

cs.GT2015

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…

cs.DS1999★ 2 cited

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…

cs.LO1999

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…