scientific article
From MaRDI portal
Publication:3579475
zbMath1192.91085MaRDI QIDQ3579475
Ariel D. Procaccia, Jeffrey S. Rosenschein, Michael Zuckerman
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The learnability of voting rules ⋮ Computational complexity of manipulation: a survey ⋮ Is computational complexity a barrier to manipulation? ⋮ Binary linear programming solutions and non-approximability for control problems in voting systems ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
This page was built for publication:
