scientific article; zbMATH DE number 6928629

zbMath1394.91121MaRDI QIDQ4583963

Jörg Rothe, Lena Schend, Yannick Reisch

Publication date: 29 August 2018

Full work available at URL: http://ebooks.iospress.nl/volumearticle/37214

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitycomputational social choicemargin of victoryCopeland electionscup electionsSchulze elections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Related Items (5)

Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games ⋮ Often Harder than in the Constructive Case: Destructive Bribery in CP-nets ⋮ A note on the complexity of manipulating weighted Schulze voting ⋮ Predicting winner and estimating margin of victory in elections using sampling ⋮ Complexity of shift bribery for iterative voting rules

This page was built for publication: