A Characterization of Combinatorial Demand

DOI10.1287/moor.2017.0859zbMath1506.91083arXiv1605.09761OpenAlexW2417811744MaRDI QIDQ5219292

Christopher P. Chambers, Federico Echenique

Publication date: 11 March 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.09761

zbMATH Keywords

combinatorial auctionslaw of demandcyclic monotonicity

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Consumer behavior, demand theory (91B42)

Related Items (1)

WARP and combinatorial choice

Cites Work

• Unnamed Item
• Identifying combinatorial valuations from aggregate demand
• The nonparametric approach to applied welfare analysis
• A necessary and sufficient condition for rationalizability in a quasilinear context
• Gross substitutability: an algorithmic survey
• Applications of discrete convex analysis to mathematical economics
• Characterization of the subdifferentials of convex functions
• Monotonicity and Implementability
• Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation
• Discrete Convex Analysis

This page was built for publication: A Characterization of Combinatorial Demand