The computational complexity of rationalizing Pareto optimal choice behavior

Abstract

We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability. Pareto rationalizability requires that we can endow each individual in the coalition with a preference relation such that the observed choices are Pareto… (More)
DOI: 10.1007/s00355-013-0735-1

8 Figures and Tables

Topics

  • Presentations referencing similar topics