default search action
Egor Ianovski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Aleksei Y. Kondratev, Egor Ianovski:
Veto Core Consistent Preference Aggregation. AAMAS 2024: 1020-1028 - 2022
- [j6]Egor Ianovski
:
Electing a committee with dominance constraints. Ann. Oper. Res. 318(2): 985-1000 (2022) - [c6]Egor Ianovski
Welfare Effects of Strategic Voting Under Scoring Rules. EUMAS 2022: 207-220 - [i15]Daria Teplova, Egor Ianovski:
Comparing the Manipulability of Approval Voting and Borda. CoRR abs/2203.15494 (2022) - [i14]Egor Ianovski, Daria Teplova, Valeriia Kuka:
Welfare effects of strategic voting under scoring rules. CoRR abs/2204.10897 (2022) - 2021
- [j5]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): 597-601 (2021) - [c5]Egor Ianovski, Aleksei Y. Kondratev:
Computing the Proportional Veto Core. AAAI 2021: 5489-5496 - [c4]Natalya Goryunova
A Noisy-Labels Approach to Detecting Uncompetitive Auctions. LOD 2021: 185-200 - [i13]Natalya Goryunova, Artem Baklanov, Egor Ianovski:
Detecting corruption in single-bidder auctions via positive-unlabelled learning. CoRR abs/2102.05523 (2021) - 2020
- [i12]Egor Ianovski, Aleksei Y. Kondratev:
Computing the proportional veto core. CoRR abs/2003.09153 (2020)
2010 – 2019
- 2019
- [j4]Egor Ianovski
Manipulability of consular election rules. Soc. Choice Welf. 52(2): 363-393 (2019) - [i11]Egor Ianovski:
Electing a committee with constraints. CoRR abs/1902.05909 (2019) - [i10]Aleksei Y. Kondratev, Egor Ianovski, Alexander S. Nesterov:
How should we score athletes and candidates: geometric scoring rules. CoRR abs/1907.05082 (2019) - 2018
- [j3]Egor Ianovski
The complexity of decision problems about equilibria in two-player Boolean games. Artif. Intell. 261: 1-15 (2018) - [j2]Egor Ianovski
Simulating cardinal preferences in Boolean games: A proof technique. Inf. Comput. 261: 488-518 (2018) - 2017
- [i9]Egor Ianovski:
Complexity of mixed equilibria in Boolean games. CoRR abs/1702.03620 (2017) - 2016
- [b1]Egor Ianovski:
Complexity of mixed equilibria in Boolean games. University of Oxford, UK, 2016 - [i8]Egor Ianovski, Mark C. Wilson:
Manipulability of consular election rules. CoRR abs/1611.07102 (2016) - [i7]Egor Ianovski:
Two statements of the Duggan-Schwartz theorem. CoRR abs/1611.07105 (2016) - 2014
- [j1]Egor Ianovski
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79(3): 859-881 (2014) - [c3]Egor Ianovski, Luke Ong:
EGuaranteeNash for Boolean Games Is NEXP-Hard. KR 2014 - [i6]Egor Ianovski:
The existential fragment of S1S over element and successor is the co-Buchi languages. CoRR abs/1401.4932 (2014) - [i5]Egor Ianovski:
DValue for Boolean games is EXP-complete. CoRR abs/1403.7428 (2014) - 2013
- [i4]Egor Ianovski:
Computable Component-wise Reducibility. CoRR abs/1301.7112 (2013) - [i3]Egor Ianovski, Luke Ong:
EGuaranteeNash for Boolean Games is NEXP-Hard. CoRR abs/1312.4114 (2013) - 2012
- [c2]Alwen Tiu, Egor Ianovski, Rajeev Goré:
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures. Advances in Modal Logic 2012: 516-537 - [i2]Egor Ianovski:
Cake Cutting Mechanisms. CoRR abs/1203.0100 (2012) - [i1]Alwen Tiu, Egor Ianovski, Rajeev Goré:
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures. CoRR abs/1204.2413 (2012) - 2011
- [c1]Egor Ianovski
The Complexity of Safe Manipulation under Scoring Rules. IJCAI 2011: 246-251
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-05 00:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: