Aggregation Theorems for Allocation Problems
From MaRDI portal
Publication:3323962
Recommendations
Cites work
- scientific article; zbMATH DE number 3823446 (Why is no real title available?)
- scientific article; zbMATH DE number 3715254 (Why is no real title available?)
- scientific article; zbMATH DE number 3737329 (Why is no real title available?)
- scientific article; zbMATH DE number 3597292 (Why is no real title available?)
- scientific article; zbMATH DE number 3225653 (Why is no real title available?)
- scientific article; zbMATH DE number 3279580 (Why is no real title available?)
- A Characterization of Weighted Arithmetic Means
- Allocation, Lehrer models, and the consensus of probabilities
- Representation for measures of information with the branching property
Cited in
(16)- Probabilistic opinion pooling generalized. II: The premise-based approach
- A global convergence theorem for aggregation algorithms
- Probabilistic opinion pooling generalized. I: General agendas
- Pexider's equation and aggregation of allocations
- Characterizations of sum form information measures on open domains
- Algebraic aggregation theory
- Measures of distance between probability distributions
- Pooling operators with the marginalization property
- Some recent applications of functional equations to the social and behavioral sciences. Further problems
- Aggregating sets of von Neumann-Morgenstern utilities
- An impossibility theorem for allocation aggregation
- Aggregating randomized and vector valued allocations
- Construction of aggregation paradoxes through load-sharing models
- Consensus for belief functions and related uncertainty measures
- Aggregation theorems and multidimensional stochastic choice models
- Paul Erdős on functional equations: Contributions and impact
This page was built for publication: Aggregation Theorems for Allocation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323962)