Яновский Егор Александрович
- Научный сотрудник:НИУ ВШЭ в Санкт-Петербурге / Санкт-Петербургская школа экономики и менеджмента / Международная лаборатория теории игр и принятия решений
- Начал работать в НИУ ВШЭ в 2019 году.
Публикации8
- Препринт Ianovski E. Electing a committee with dominance constraints / Cornell University. Series arxive "math". 2019.
- Статья Ianovski E., Wilson M. C. Manipulability of consular election rules // Social Choice and Welfare. 2019. Vol. 2. No. 52. P. 363-393. doi
- Статья Ianovski E., Ong L. Simulating cardinal preferences in Boolean games: A proof technique // Information and Computation. 2018. No. 261. P. 488-518. doi
- Статья Ianovski E., Ong L. The complexity of decision problems about equilibria in two-player Boolean games // Artificial Intelligence. 2018. No. 261. P. 1-15. doi
- Статья Ianovski E., Miller R. G., Ng K. M., Nies A. Complexity of Equivalence Relations and Preorders from Computability Theory // Journal of Symbolic Logic. 2014. Vol. 3. No. 79. P. 859-881. doi
- Глава книги Ianovski E., Ong L. EGuaranteeNash for Boolean Games Is NEXP-Hard, in: Proceedings, Fourteenth International Conference on Principles of Knowledge Representation and Reasoning (KR-14). Palo Alto : AAAI Press, 2014.
- Глава книги Tiu A., Ianovski E., Goré R. Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures, in: Advances in Modal Logic Issue 9. L. : College Publications, 2012. P. 516-537.
- Глава книги Ianovski E., Yu L., Elkind E., Wilson M. C. The Complexity of Safe Manipulation under Scoring Rules, in: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22. IJCAI/AAAI, 2011. P. 246-251. doi
