The computational complexity of rationalizing Pareto optimal choice behavior
Year of publication: |
2014
|
---|---|
Authors: | Demuynck, Thomas |
Published in: |
Social choice and welfare. - Berlin : Springer, ISSN 0176-1714, ZDB-ID 855101-7. - Vol. 42.2014, 3, p. 529-549
|
Subject: | Pareto efficiency | Computational complexity | NP-complete | Pareto-Optimum | Mathematische Optimierung | Mathematical programming | Neue politische Ökonomie | Public choice | Theorie | Theory |
-
The computational complexity of rationalizing Pareto optimal choice behavior
Demuynck, Thomas, (2011)
-
The Computational Complexity of Rationalizing Pareto Optimal Choice Behavior
Demuynck, Thomas, (2011)
-
Multiobjective optimization for politically fair districting : a scalable multilevel approach
Swamy, Rahul, (2023)
- More ...
-
On the revealed preference analysis of stable aggregate matchings
Demuynck, Thomas, (2022)
-
Poor and wealthy hand-to-mouth households in Belgium
Cherchye, Laurens, (2023)
-
Spouses with benefits: On match quality and consumption inside households
Browning, Martin James, (2024)
- More ...