Egor Ianovski

According to our database1, Egor Ianovski authored at least 17 papers between 2011 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Computing the proportional veto core.
CoRR, 2020

2019
Manipulability of consular election rules.
Soc. Choice Welf., 2019

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

Electing a committee with constraints.
CoRR, 2019

2018
Simulating cardinal preferences in Boolean games: A proof technique.
Inf. Comput., 2018

The complexity of decision problems about equilibria in two-player Boolean games.
Artif. Intell., 2018

2017
Complexity of mixed equilibria in Boolean games.
CoRR, 2017

2016
Complexity of mixed equilibria in Boolean games.
PhD thesis, 2016

Two statements of the Duggan-Schwartz theorem.
CoRR, 2016

2014
Complexity of Equivalence Relations and Preorders from Computability Theory.
J. Symb. Log., 2014

DValue for Boolean games is EXP-complete.
CoRR, 2014

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

EGuaranteeNash for Boolean Games Is NEXP-Hard.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

2013
Computable Component-wise Reducibility
CoRR, 2013

2012
Cake Cutting Mechanisms
CoRR, 2012

Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures.
Proceedings of the Advances in Modal Logic 9, 2012

2011
The Complexity of Safe Manipulation under Scoring Rules.
Proceedings of the IJCAI 2011, 2011


  Loading...