Approximation Algorithms for BalancedCC Multiwinner Rules. Brill, M., Faliszewski, P., Sommer, F., & Talmon, N. In Elkind, E., Veloso, M., Agmon, N., & Taylor, M. E., editors, AAMAS, pages 494-502, 2019. International Foundation for Autonomous Agents and Multiagent Systems.
Approximation Algorithms for BalancedCC Multiwinner Rules. [link]Link  Approximation Algorithms for BalancedCC Multiwinner Rules. [link]Paper  bibtex   
@inproceedings{conf/atal/BrillFST19,
  added-at = {2019-05-29T00:00:00.000+0200},
  author = {Brill, Markus and Faliszewski, Piotr and Sommer, Frank and Talmon, Nimrod},
  biburl = {https://www.bibsonomy.org/bibtex/21c06f4cd89da13025c58a171b9eda2f7/dblp},
  booktitle = {AAMAS},
  crossref = {conf/atal/2019},
  editor = {Elkind, Edith and Veloso, Manuela and Agmon, Noa and Taylor, Matthew E.},
  ee = {http://dl.acm.org/citation.cfm?id=3331732},
  interhash = {657772a38b151454679542ed2b4105f1},
  intrahash = {1c06f4cd89da13025c58a171b9eda2f7},
  isbn = {978-1-4503-6309-9},
  keywords = {dblp},
  pages = {494-502},
  publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
  timestamp = {2019-05-30T11:55:59.000+0200},
  title = {Approximation Algorithms for BalancedCC Multiwinner Rules.},
  url = {http://dblp.uni-trier.de/db/conf/atal/aamas2019.html#BrillFST19},
  year = 2019
}

Downloads: 0