Testing Top Monotonicity
Computer Science and Game Theory
2014-06-03 v5
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.
Cite
@article{arxiv.1403.7625,
title = {Testing Top Monotonicity},
author = {Haris Aziz},
journal= {arXiv preprint arXiv:1403.7625},
year = {2014}
}