Egor Ianovski

According to our database, Egor Ianovski authored at least 23 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Comparing the Manipulability of Approval Voting and Borda.

Daria Teplova, Egor Ianovski

CoRR, 2022

Electing a committee with dominance constraints.

Egor Ianovski

Ann. Oper. Res., 2022

Welfare Effects of Strategic Voting Under Scoring Rules.

Egor Ianovski, Daria Teplova, Valeriia Kuka

Proceedings of the Multi-Agent Systems - 19th European Conference, 2022

2021

In memory of Victoria Kreps (3 September 1945-3 March 2021).

Anna Bogomolnaia, Misha Gavrilovich, Egor Ianovski, Galina Lyapunova, Hervé Moulin, Alexander S. Nesterov, Marina Sandomirskaia, Fedor Sandomirskiy, Elena Yanovskaya

Int. J. Game Theory, 2021

Detecting corruption in single-bidder auctions via positive-unlabelled learning.

Natalya Goryunova, Artem Baklanov, Egor Ianovski

CoRR, 2021

A Noisy-Labels Approach to Detecting Uncompetitive Auctions.

Natalya Goryunova, Artem Baklanov, Egor Ianovski

Proceedings of the Machine Learning, Optimization, and Data Science, 2021

Computing the Proportional Veto Core.

Egor Ianovski, Aleksei Y. Kondratev

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2019

Manipulability of consular election rules.

Egor Ianovski, Mark C. Wilson

Soc. Choice Welf., 2019

How should we score athletes and candidates: geometric scoring rules.

Aleksei Y. Kondratev, Egor Ianovski, Alexander S. Nesterov

CoRR, 2019

Electing a committee with constraints.

Egor Ianovski

CoRR, 2019

2018

Simulating cardinal preferences in Boolean games: A proof technique.

Egor Ianovski, Luke Ong

Inf. Comput., 2018

The complexity of decision problems about equilibria in two-player Boolean games.

Egor Ianovski, Luke Ong

Artif. Intell., 2018

2017

Complexity of mixed equilibria in Boolean games.

Egor Ianovski

CoRR, 2017

2016

Complexity of mixed equilibria in Boolean games.

Egor Ianovski

PhD thesis, 2016

Two statements of the Duggan-Schwartz theorem.

Egor Ianovski

CoRR, 2016

2014

Complexity of Equivalence Relations and Preorders from Computability Theory.

Egor Ianovski, Russell G. Miller, Keng Meng Ng, André Nies

J. Symb. Log., 2014

DValue for Boolean games is EXP-complete.

Egor Ianovski

CoRR, 2014

The existential fragment of S1S over element and successor is the co-Buchi languages.

Egor Ianovski

CoRR, 2014

EGuaranteeNash for Boolean Games Is NEXP-Hard.

Egor Ianovski, Luke Ong

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

2013

Computable Component-wise Reducibility

Egor Ianovski

CoRR, 2013

2012

Cake Cutting Mechanisms

Egor Ianovski

CoRR, 2012

Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures.

Alwen Tiu, Egor Ianovski, Rajeev Goré

Proceedings of the Advances in Modal Logic 9, 2012

2011

The Complexity of Safe Manipulation under Scoring Rules.

Egor Ianovski, Lan Yu, Edith Elkind, Mark C. Wilson

Proceedings of the IJCAI 2011, 2011