
Threedimensional matching is NPHard
The standard proof of NPHardness of 3DM provides a power4 reduction of...
read it

On the Hardness of Energy Minimisation for Crystal Structure Prediction
Crystal Structure Prediction (csp) is one of the central and most challe...
read it

Euclidean 3D Stable Roommates is NPhard
We establish NPcompleteness for the Euclidean 3D Stable Roommates probl...
read it

A Note on the Flip Distance Problem for EdgeLabeled Triangulations
For both triangulations of point sets and simple polygons, it is known t...
read it

MaximumLikelihood Network Reconstruction for SIS Processes is NPHard
The knowledge of the network topology is imperative to precisely describ...
read it

Computing the Difficulty of Critical Bootstrap Percolation Models is NPhard
Bootstrap percolation is a class of cellular automata with random initia...
read it

Choice Set Optimization Under Discrete Choice Models of Group Decisions
The way that people make choices or exhibit preferences can be strongly ...
read it
Kemeny ranking is NPhard for 2dimensional Euclidean preferences
The assumption that voters' preferences share some common structure is a standard way to circumvent NPhardness results in social choice problems. While the Kemeny ranking problem is NPhard in the general case, it is known to become easy if the preferences are 1dimensional Euclidean. In this note, we prove that the Kemeny ranking problem is NPhard for ddimensional Euclidean preferences with d>=2. We note that this result also holds for the Slater ranking problem.
READ FULL TEXT
Comments
There are no comments yet.