scientific article; zbMATH DE number 7051276
From MaRDI portal
Publication:4633920
zbMath1425.91143MaRDI QIDQ4633920
Jason A. Covey, Nikos Karanikolas, Ariel D. Procaccia, Christos Kaklamanis, Jeffrey S. Rosenschein, Michal Feldman, Ioannis Caragiannis, Christopher M. Homan
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496885
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
Beyond the worst case: semi-random complexity analysis of winner determination ⋮ Parameterized Computational Complexity of Dodgson and Young Elections
This page was built for publication:
