{
  "id": "1403.7625",
  "version": "v5",
  "published": "2014-03-29T11:51:07.000Z",
  "updated": "2014-06-01T01:46:35.000Z",
  "title": "Testing Top Monotonicity",
  "authors": [
    "Haris Aziz"
  ],
  "categories": [
    "cs.GT"
  ],
  "abstract": "Top monotonicity is a relaxation of various well-known domain restrictions such as single-peaked and single-crossing for which negative impossibility results are circumvented and for which the median-voter theorem still holds. We examine the problem of testing top monotonicity and present a characterization of top monotonicity with respect to non-betweenness constraints. We then extend the definition of top monotonicity to partial orders and show that testing top monotonicity of partial orders is NP-complete.",
  "revisions": [
    {
      "version": "v5",
      "updated": "2014-06-01T01:46:35.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "91A12",
      "68Q15",
      "J.4",
      "F.2"
    ],
    "keywords": [
      "monotonicity",
      "partial orders",
      "well-known domain restrictions",
      "non-betweenness constraints",
      "median-voter theorem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1403.7625A"
    }
  }
}