Seguir
Svetlana Obraztsova
Svetlana Obraztsova
Nanyang Technological University
Dirección de correo verificada de ntu.edu.sg
Título
Citado por
Citado por
Año
On the convergence of iterative voting: how restrictive should restricted dynamics be?
S Obraztsova, E Markakis, M Polukarov, Z Rabinovich, N Jennings
Proceedings of the AAAI conference on artificial intelligence 29 (1), 2015
652015
Ties matter: Complexity of voting manipulation revisited
S Obraztsova, E Elkind, N Hazon
The 10th International Conference on Autonomous Agents and Multiagent …, 2011
652011
Plurality voting with truth-biased agents
S Obraztsova, E Markakis, DRM Thompson
International Symposium on Algorithmic Game Theory, 26-37, 2013
522013
Analysis of equilibria in iterative voting schemes
Z Rabinovich, S Obraztsova, O Lev, E Markakis, J Rosenschein
Proceedings of the AAAI conference on artificial intelligence 29 (1), 2015
492015
On the complexity of voting manipulation under randomized tie-breaking
S Obraztsova, E Elkind
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
472011
Strategic voting with incomplete information
U Endriss, S Obraztsova, M Polukarov, JS Rosenschein
AAAI Press/International Joint Conferences on Artificial Intelligence, 2016
442016
RMIX: Learning risk-sensitive policies for cooperative reinforcement learning agents
W Qiu, X Wang, R Yu, R Wang, X He, B An, S Obraztsova, Z Rabinovich
Advances in Neural Information Processing Systems 34, 23049-23062, 2021
362021
Optimal manipulation of voting rules
S Obraztsova, E Elkind
Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 2141-2147, 2012
332012
On manipulation in multi-winner elections based on scoring rules
S Obraztsova, Y Zick, E Elkind
Proceedings of the 2013 international conference on Autonomous agents and …, 2013
292013
Variations on the hotelling-downs model
M Feldman, A Fiat, S Obraztsova
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
282016
Equilibria of plurality voting: Lazy and truth-biased voters
E Elkind, E Markakis, S Obraztsova, P Skowron
Algorithmic Game Theory: 8th International Symposium, SAGT 2015, Saarbrücken …, 2015
262015
The complexity of recognizing incomplete single-crossing preferences
E Elkind, P Faliszewski, M Lackner, S Obraztsova
Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015
252015
Doodle poll games
S Obraztsova, Z Rabinovich, M Polukarov, E Elkind
16th International Conference on Autonomous Agents and Multiagent Systems …, 2017
242017
Mis-spoke or mis-lead: Achieving robustness in multi-agent communicative reinforcement learning
W Xue, W Qiu, B An, Z Rabinovich, S Obraztsova, CK Yeo
arXiv preprint arXiv:2108.03803, 2021
202021
Strategic candidacy games with lazy candidates
S Obraztsova, E Elkind, M Polukarov, Z Rabinovich
162015
Restricted domains of dichotomous preferences with possibly incomplete information
Z Terzopoulou, A Karpov, S Obraztsova
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5726-5733, 2021
152021
Convergence to equilibria in strategic candidacy
M Polukarov, S Obraztsova, Z Rabinovich, A Kruglyi, NR Jennings
152015
Lie on the fly: Strategic voting in an iterative preference elicitation process
L Dery, S Obraztsova, Z Rabinovich, M Kalech
Group Decision and Negotiation 28, 1077-1107, 2019
13*2019
Protecting elections by recounting ballots
E Elkind, J Gan, S Obraztsova, Z Rabinovich, AA Voudouris
Artificial Intelligence 290, 103401, 2021
122021
Real candidacy games: a new model for strategic candidacy
I Sabato, S Obraztsova, Z Rabinovich, JS Rosenschein
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017
122017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20