Egor Ianovski

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 18

Top Venues

University of Oxford, UK (PHD)

Education History

University of Oxford, UK

PHD

Publications

Aleksei Y. Kondratev, Egor Ianovski
Veto Core Consistent Preference Aggregation. AAMAS (2024)
Egor Ianovski, Daria Teplova, Valeriia Kuka
Welfare Effects of Strategic Voting Under Scoring Rules. EUMAS (2022)
Daria Teplova, Egor Ianovski
Comparing the Manipulability of Approval Voting and Borda. CoRR (2022)
Egor Ianovski, Daria Teplova, Valeriia Kuka
Welfare effects of strategic voting under scoring rules. CoRR (2022)
Egor Ianovski
Electing a committee with dominance constraints. Ann. Oper. Res. 318 (2) (2022)
Egor Ianovski, Aleksei Y. Kondratev
Computing the Proportional Veto Core. AAAI (2021)
Natalya Goryunova, Artem Baklanov, Egor Ianovski
Detecting corruption in single-bidder auctions via positive-unlabelled learning. CoRR (2021)
Natalya Goryunova, Artem Baklanov, Egor Ianovski
A Noisy-Labels Approach to Detecting Uncompetitive Auctions. LOD (2021)
Anna Bogomolnaia, Misha Gavrilovich, Egor Ianovski, Galina Lyapunova, Hervé Moulin, Alexander S. Nesterov, Marina Sandomirskaia, Fedor Sandomirskiy, Elena Yanovskaya
In memory of Victoria Kreps (3 September 1945-3 March 2021). Int. J. Game Theory 50 (3) (2021)
Egor Ianovski, Aleksei Y. Kondratev
Computing the proportional veto core. CoRR (2020)
Aleksei Y. Kondratev, Egor Ianovski, Alexander S. Nesterov
How should we score athletes and candidates: geometric scoring rules. CoRR (2019)
Egor Ianovski, Mark C. Wilson
Manipulability of consular election rules. Soc. Choice Welf. 52 (2) (2019)
Egor Ianovski
Electing a committee with constraints. CoRR (2019)
Egor Ianovski, Luke Ong
Simulating cardinal preferences in Boolean games: A proof technique. Inf. Comput. 261 (2018)
Egor Ianovski, Luke Ong
The complexity of decision problems about equilibria in two-player Boolean games. Artif. Intell. 261 (2018)
Egor Ianovski
Complexity of mixed equilibria in Boolean games. CoRR (2017)
Egor Ianovski
Two statements of the Duggan-Schwartz theorem. CoRR (2016)
Egor Ianovski, Mark C. Wilson
Manipulability of consular election rules. CoRR (2016)
Egor Ianovski, Luke Ong
EGuaranteeNash for Boolean Games Is NEXP-Hard. KR (2014)
Egor Ianovski
The existential fragment of S1S over element and successor is the co-Buchi languages. CoRR (2014)
Egor Ianovski, Russell G. Miller, Keng Meng Ng, André Nies
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79 (3) (2014)
Egor Ianovski
DValue for Boolean games is EXP-complete. CoRR (2014)
Egor Ianovski, Luke Ong
EGuaranteeNash for Boolean Games is NEXP-Hard. CoRR (2013)
Egor Ianovski
Computable Component-wise Reducibility CoRR (2013)
Egor Ianovski
Cake Cutting Mechanisms CoRR (2012)
Alwen Tiu, Egor Ianovski, Rajeev Goré
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures CoRR (2012)
Alwen Tiu, Egor Ianovski, Rajeev Goré
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures. Advances in Modal Logic (2012)
Egor Ianovski, Lan Yu, Edith Elkind, Mark C. Wilson
The Complexity of Safe Manipulation under Scoring Rules. IJCAI (2011)

Egor Ianovski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Egor Ianovski