Funder
Akademia Górniczo-Hutnicza im. Stanislawa Staszica
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Baumeister, D., Erdélyi, G., & Rothe, J. (2011). How hard is it to bribe judges? A study of the complexity of bribery in judgement aggregation. In Proceedings of the 2nd international conference on algorithmic decision theory (pp. 1–15).
2. Baumeister, D., Faliszewski, P., Lang, J., & Rothe, J. (2012). Campaigns for lazy voters: Truncated ballots. In Proceedings of the 11th international conference on autonomous agents and multiagent systems (pp. 577–584).
3. Binkele-Raible, D., Erdélyi, G., Fernau, H., Goldsmith, J., Mattei, N., & Rothe, J. (2014). The complexity of probabilistic lobbying. Discrete Optimization, 11, 1–21.
4. Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., & Niedermeier, R. (2016). Prices matter for the parameterized complexity of shift bribery. Information and Computation, 251, 140–164.
5. Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Niedermeier, R., Skowron, P., & Talmon, N. (2017). Robustness among multiwinner voting rules. In Proceedings of the 10th international symposium on algorithmic game theory (pp. 80–92).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献