Selling Multiple Complements with Packaging Costs

Simon Finster
Additional contact information
Simon Finster: FAIRPLAY - IA coopérative : équité, vie privée, incitations - CREST - Centre de Recherche en Économie et Statistique - ENSAI - Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] - GENES - Groupe des Écoles Nationales d'Économie et Statistique - X - École polytechnique - IP Paris - Institut Polytechnique de Paris - ENSAE Paris - École Nationale de la Statistique et de l'Administration Économique - GENES - Groupe des Écoles Nationales d'Économie et Statistique - IP Paris - Institut Polytechnique de Paris - CNRS - Centre National de la Recherche Scientifique - IP Paris - Institut Polytechnique de Paris - Criteo AI Lab - Criteo [Paris] - Centre Inria de l'Institut Polytechnique de Paris - Centre Inria de Saclay - Inria - Institut National de Recherche en Informatique et en Automatique, CREST - Centre de Recherche en Économie et Statistique - ENSAI - Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] - GENES - Groupe des Écoles Nationales d'Économie et Statistique - X - École polytechnique - IP Paris - Institut Polytechnique de Paris - ENSAE Paris - École Nationale de la Statistique et de l'Administration Économique - GENES - Groupe des Écoles Nationales d'Économie et Statistique - IP Paris - Institut Polytechnique de Paris - CNRS - Centre National de la Recherche Scientifique

Post-Print from HAL

Abstract: We consider a package assignment problem with multiple units of indivisible items. The seller can specify preferences over partitions of their supply between buyers as packaging costs. We propose incremental costs together with a graph that defines cost interdependence to express these preferences. This facilitates the use of linear programming to characterize Walrasian equilibrium prices. Firstly, we show that equilibrium prices are uniform, anonymous, and linear in packages. Prices and marginal gains exhibit a nested structure, which we characterize in closed form for complete graphs. Secondly, we provide sufficient conditions for the existence of package-linear competitive prices using an ascending auction implementation. Our framework of partition preferences ensures fair and transparent dual pricing and admits preferences over the concentration of allocated bundles in the market.

Keywords: linear programming; value graph; partition preferences; Walrasian equilibrium; non-linear pricing; package assignment (search for similar items in EconPapers)
Date: 2025-07-07
Note: View the original document on HAL open archive server: https://hal.science/hal-05233957v1
References: Add references at CitEc
Citations:

Published in EC '25: 26th ACM Conference on Economics and Computation, Jul 2025, Stanford (CA), United States. pp.250-250, ⟨10.1145/3736252.3742522⟩

Downloads: (external link)
https://hal.science/hal-05233957v1/document (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-05233957

DOI: 10.1145/3736252.3742522

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().