default search action
Svetlana Obraztsova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c44]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Temporal Fairness in Multiwinner Voting. AAAI 2024: 22633-22640 - [c43]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Verifying Proportionality in Temporal Voting. AAMAS 2024: 2246-2248 - 2023
- [c42]Wei Qiu, Weixun Wang, Rundong Wang, Bo An, Yujing Hu, Svetlana Obraztsova, Zinovi Rabinovich, Jianye Hao, Yingfeng Chen, Changjie Fan:
Off-Beat Multi-Agent Reinforcement Learning. AAMAS 2023: 2424-2426 - [c41]Wei Qiu, Xiao Ma, Bo An, Svetlana Obraztsova, Shuicheng Yan, Zhongwen Xu:
RPM: Generalizable Multi-Agent Policies for Multi-Agent Reinforcement Learning. ICLR 2023 - [i12]Edith Elkind, Svetlana Obraztsova, Nicholas Teh:
Temporal Fairness in Multiwinner Voting. CoRR abs/2312.04417 (2023) - 2022
- [j3]Piotr Faliszewski
, Alexander Karpov, Svetlana Obraztsova:
The complexity of election problems with group-separable preferences. Auton. Agents Multi Agent Syst. 36(1): 18 (2022) - [c40]Wanqi Xue, Wei Qiu, Bo An, Zinovi Rabinovich, Svetlana Obraztsova, Chai Kiat Yeo:
Mis-spoke or mis-lead: Achieving Robustness in Multi-Agent Communicative Reinforcement Learning. AAMAS 2022: 1418-1426 - [c39]Marina Bannikova, Lihi Dery, Svetlana Obraztsova, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Reaching Consensus Under a Deadline. AAMAS 2022: 1920-1922 - [c38]Alexander Karpov
Hotelling-Downs Equilibria: Moving Beyond Plurality Variants. GDN 2022: 3-16 - [i11]Wei Qiu, Weixun Wang
Off-Beat Multi-Agent Reinforcement Learning. CoRR abs/2205.13718 (2022) - [i10]Wei Qiu, Xiao Ma, Bo An, Svetlana Obraztsova, Shuicheng Yan, Zhongwen Xu:
RPM: Generalizable Behaviors for Multi-Agent Reinforcement Learning. CoRR abs/2210.09646 (2022) - 2021
- [j2]Marina Bannikova, Lihi Dery
Reaching consensus under a deadline. Auton. Agents Multi Agent Syst. 35(1): 9 (2021) - [j1]Edith Elkind, Jiarui Gan
Protecting elections by recounting ballots. Artif. Intell. 290: 103401 (2021) - [c37]Zoi Terzopoulou, Alexander Karpov, Svetlana Obraztsova:
Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information. AAAI 2021: 5726-5733 - [c36]Wei Qiu, Xinrun Wang, Runsheng Yu, Rundong Wang, Xu He, Bo An, Svetlana Obraztsova, Zinovi Rabinovich:
RMIX: Learning Risk-Sensitive Policies for Cooperative Reinforcement Learning Agents. NeurIPS 2021: 23049-23062 - [i9]Wei Qiu, Xinrun Wang, Runsheng Yu, Xu He, Rundong Wang, Bo An, Svetlana Obraztsova, Zinovi Rabinovich:
RMIX: Learning Risk-Sensitive Policies for Cooperative Reinforcement Learning Agents. CoRR abs/2102.08159 (2021) - [i8]Wanqi Xue, Wei Qiu, Bo An, Zinovi Rabinovich, Svetlana Obraztsova, Chai Kiat Yeo:
Mis-spoke or mis-lead: Achieving Robustness in Multi-Agent Communicative Reinforcement Learning. CoRR abs/2108.03803 (2021) - 2020
- [c35]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski
On Swap Convexity of Voting Rules. AAAI 2020: 1910-1917 - [c34]Svetlana Obraztsova, Maria Polukarov, Edith Elkind, Marek Grzesiuk:
Multiwinner Candidacy Games. AAMAS 2020: 957-965 - [c33]Zoi Terzopoulou, Alexander Karpov, Svetlana Obraztsova:
Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information. AAMAS 2020: 2023-2025 - [c32]Piotr Faliszewski
The Complexity of Election Problems with Group-Separable Preferences. IJCAI 2020: 203-209
2010 – 2019
- 2019
- [c31]Omer Lev, Reshef Meir, Svetlana Obraztsova, Maria Polukarov:
Heuristic Voting as Ordinal Dominance Strategies. AAAI 2019: 2077-2084 - [c30]Jasper Lu, David Kai Zhang, Zinovi Rabinovich, Svetlana Obraztsova, Yevgeniy Vorobeychik:
Manipulating Elections by Selecting Issues. AAMAS 2019: 529-537 - [c29]Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris:
Protecting Elections by Recounting Ballots. IJCAI 2019: 259-265 - [i7]Lihi Dery, Svetlana Obraztsova, Zinovi Rabinovich, Meir Kalech:
Lie on the Fly: Strategic Voting in an Iterative Preference Elicitation Process. CoRR abs/1905.04933 (2019) - [i6]Marina Bannikova, Lihi Dery, Svetlana Obraztsova, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Between Discord and Deadlock: Consensus Under a Deadline. CoRR abs/1905.07173 (2019) - [i5]Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris:
Protecting Elections by Recounting Ballots. CoRR abs/1906.07071 (2019) - [i4]Jasper Lu, David Kai Zhang, Zinovi Rabinovich, Svetlana Obraztsova, Yevgeniy Vorobeychik:
Manipulating Elections by Selecting Issues. CoRR abs/1911.12472 (2019) - 2018
- [i3]Omer Lev, Reshef Meir, Svetlana Obraztsova, Maria Polukarov:
Heuristic Voting as Ordinal Dominance Strategies. CoRR abs/1811.05529 (2018) - 2017
- [c28]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI 2017: 390-396 - [c27]Itay Sabato, Svetlana Obraztsova, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Real Candidacy Games: A New Model for Strategic Candidacy. AAMAS 2017: 867-875 - [c26]Svetlana Obraztsova, Maria Polukarov, Zinovi Rabinovich, Edith Elkind:
Doodle Poll Games. AAMAS 2017: 876-884 - [c25]Svetlana Obraztsova, Omer Lev, Evangelos Markakis, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Distant Truth: Bias Under Vote Distortion Costs. AAMAS 2017: 885-892 - [c24]David Ben Yosef, Lihi Naamani Dery
Haste makes waste: a case to favour voting bots. WI 2017: 419-425 - 2016
- [c23]Michal Feldman, Amos Fiat, Svetlana Obraztsova:
Variations on the Hotelling-Downs Model. AAAI 2016: 496-501 - [c22]Edith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron:
Complexity of Finding Equilibria of Plurality Voting Under Structured Preferences. AAMAS 2016: 394-401 - [c21]Ulle Endriss, Svetlana Obraztsova, Maria Polukarov, Jeffrey S. Rosenschein:
Strategic Voting with Incomplete Information. IJCAI 2016: 236-242 - [c20]Svetlana Obraztsova, Zinovi Rabinovich, Edith Elkind, Maria Polukarov, Nicholas R. Jennings:
Trembling Hand Equilibria of Plurality Voting. IJCAI 2016: 440-446 - [i2]Robert Bredereck, Jiehua Chen, Rolf Niedermeier, Svetlana Obraztsova, Nimrod Talmon:
Teams in Online Scheduling Polls: Game-Theoretic Aspects. CoRR abs/1611.08892 (2016) - 2015
- [c19]Edith Elkind, Piotr Faliszewski, Martin Lackner, Svetlana Obraztsova:
The Complexity of Recognizing Incomplete Single-Crossing Preferences. AAAI 2015: 865-871 - [c18]Svetlana Obraztsova, Evangelos Markakis, Maria Polukarov, Zinovi Rabinovich, Nicholas R. Jennings:
On the Convergence of Iterative Voting: How Restrictive Should Restricted Dynamics Be? AAAI 2015: 993-999 - [c17]Zinovi Rabinovich, Svetlana Obraztsova, Omer Lev, Evangelos Markakis, Jeffrey S. Rosenschein:
Analysis of Equilibria in Iterative Voting Schemes. AAAI 2015: 1007-1013 - [c16]Svetlana Obraztsova, Omer Lev, Evangelos Markakis, Zinovi Rabinovich
Beyond Plurality: Truth-Bias in Binary Scoring Rules. ADT 2015: 451-468 - [c15]Svetlana Obraztsova, Omer Lev, Evangelos Markakis, Zinovi Rabinovich, Jeffrey S. Rosenschein:
Beyond Plurality: Truth-Bias in Binary Scoring Rules. AAMAS 2015: 1733-1734 - [c14]Svetlana Obraztsova, Edith Elkind, Maria Polukarov, Zinovi Rabinovich:
Strategic Candidacy Games with Lazy Candidates. IJCAI 2015: 610-616 - [c13]Maria Polukarov, Svetlana Obraztsova, Zinovi Rabinovich, Alexander Kruglyi, Nicholas R. Jennings:
Convergence to Equilibria in Strategic Candidacy. IJCAI 2015: 624-630 - [c12]Lihi Naamani Dery, Svetlana Obraztsova, Zinovi Rabinovich, Meir Kalech:
Lie on the Fly: Iterative Voting Center with Manipulative Voters. IJCAI 2015: 2033-2039 - [c11]Edith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron
Equilibria of Plurality Voting: Lazy and Truth-Biased Voters. SAGT 2015: 110-122 - 2014
- [c10]Svetlana Obraztsova, Zinovi Rabinovich
Faustian Dynamics in Sarkar's Social Cycle. ECAI 2014: 1071-1072 - [c9]Dimitris Fotakis, Thodoris Lykouris, Evangelos Markakis, Svetlana Obraztsova:
Influence Maximization in Switching-Selection Threshold Models. SAGT 2014: 122-133 - [i1]Edith Elkind, Evangelos Markakis, Svetlana Obraztsova, Piotr Skowron:
Equilibria of Plurality Voting: Lazy and Truth-biased Voters. CoRR abs/1409.4132 (2014) - 2013
- [c8]Svetlana Obraztsova, Yair Zick, Edith Elkind:
On manipulation in multi-winner elections based on scoring rules. AAMAS 2013: 359-366 - [c7]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On swap-distance geometry of voting rules. AAMAS 2013: 383-390 - [c6]Svetlana Obraztsova, Evangelos Markakis, David R. M. Thompson:
Plurality Voting with Truth-Biased Agents. SAGT 2013: 26-37 - 2012
- [c5]Svetlana Obraztsova, Edith Elkind:
Optimal Manipulation of Voting Rules. AAAI 2012: 2141-2147 - [c4]Svetlana Obraztsova, Edith Elkind:
Optimal manipulation of voting rules. AAMAS 2012: 619-626 - 2011
- [c3]Svetlana Obraztsova, Edith Elkind, Noam Hazon:
Ties matter: complexity of voting manipulation revisited. AAMAS 2011: 71-78 - [c2]Svetlana Obraztsova, Edith Elkind:
On the Complexity of Voting Manipulation under Randomized Tie-Breaking. IJCAI 2011: 319-324 - [c1]Svetlana Obraztsova, Edith Elkind, Noam Hazon
Ties Matter: Complexity of Voting Manipulation Revisited. IJCAI 2011: 2698-2703
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-07-25 19:26 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: