"The computational complexity of rationalizing Pareto optimal choice behavior."

Thomas Demuynck (2014)

> Home

Details and statistics

DOI: 10.1007/S00355-013-0735-1

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scw/Demuynck14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scw/Demuynck14
Thomas Demuynck:
The computational complexity of rationalizing Pareto optimal choice behavior. Soc. Choice Welf. 42(3): 529-549 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.