Egor Ianovski

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