A characterization of the existence of succinct linear representation of subset-valuations
From MaRDI portal
Publication:6167805
DOI10.1016/j.jmp.2023.102779zbMath1520.91120OpenAlexW4378651046MaRDI QIDQ6167805
Publication date: 7 August 2023
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2023.102779
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Auction design with costly preference elicitation
- Understanding and using linear programming
- Signed orders and power set extensions
- Binary interactions and subset choice
- Cancellation conditions for finite two-dimensional additive measurement
- Fair division of indivisible items
- Finite linear qualitative probability
- Peaches, lemons, and cookies: designing auction markets with dispersed information
- The repeated insertion model for rankings: missing link between two subset choice models
- Nontransitive preferences in decision theory
- Sources of complexity in subset choice
- The communication requirements of efficient allocations and supporting prices
- Computationally Manageable Combinational Auctions
- Combinatorial Auction Design
- Bundling Information Goods: Pricing, Profits, and Efficiency
- Optimal Bundle Pricing
- Utility as an Additive Set Function
- The Theorem of the Alternative in Social Choice Theory
- Subset Comparisons for Additive Linear Orders
This page was built for publication: A characterization of the existence of succinct linear representation of subset-valuations