An impossibility theorem for allocation aggregation
From MaRDI portal
Publication:484202
DOI10.1007/S10992-014-9315-9zbMATH Open1320.91059OpenAlexW2088893478MaRDI QIDQ484202FDOQ484202
Authors: Mark Shattuck, Carl G. Wagner 
Publication date: 18 December 2014
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-014-9315-9
Recommendations
- Aggregation Theorems for Allocation Problems
- An impossibility theorem on capital allocation
- A general equivalence theorem for allocation of indivisible objects
- A new impossibility result for random assignments
- An intersection theorem on an unbounded set and its application to the fair allocation problem
- Strategy-proof and Pareto efficient allocation of indivisible goods: general impossibility domains
- A note on the fundamental theorem of exact aggregation
- Impossibilities for probabilistic assignment
- An impossibility theorem with von Neumann-Morgenstern preferences
- Abstract aggregations and proximity preservation: an impossibility result
Cites Work
- Title not available (Why is that?)
- Cores of convex games
- Judgment aggregation: (im)possibility theorems
- Marginalization and Linear Opinion Pools
- Title not available (Why is that?)
- Consensus for belief functions and related uncertainty measures
- Combining probability distributions: a critique and an annotated bibliography. With comments, and a rejoinder by the authors
- Aggregation Theorems for Allocation Problems
- Pooling operators with the marginalization property
- Jeffrey conditioning and external Bayesianity
- Title not available (Why is that?)
- A Characterization of Weighted Arithmetic Means
- Peer disagreement and independence preservation
Cited In (4)
This page was built for publication: An impossibility theorem for allocation aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484202)
