Aggregation Theorems for Allocation Problems

DOI10.1137/0605001zbMath0538.05006OpenAlexW2094817794MaRDI QIDQ3323962

Che Tat Ng, János Aczél, Carl G. Wagner

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3931e57526b83d4d7fb7298170519656471c592f

zbMATH Keywords

allocation problemsweighted arithmetic averagingassignment techniques

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Discrete mathematics in relation to computer science (68R99) Mathematical programming (90C99)

Related Items

Some recent applications of functional equations to the social and behavioral sciences. Further problems ⋮ Characterizations of sum form information measures on open domains ⋮ Measures of distance between probability distributions ⋮ Paul Erdős on functional equations: Contributions and impact ⋮ Consensus for belief functions and related uncertainty measures ⋮ Probabilistic opinion pooling generalized. I: General agendas ⋮ Probabilistic opinion pooling generalized. II: The premise-based approach ⋮ An impossibility theorem for allocation aggregation ⋮ Pooling operators with the marginalization property ⋮ Pexider's equation and aggregation of allocations ⋮ Aggregation theorems and multidimensional stochastic choice models

Cites Work

• Allocation, Lehrer models, and the consensus of probabilities
• A Characterization of Weighted Arithmetic Means
• Representation for measures of information with the branching property
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Aggregation Theorems for Allocation Problems