Combinatorial exchanges have attracted much attention recently. However, to this point there is no generally accepted payment allocation algorithm capable of clearing combinatorial exchanges. The Vickrey-Groves-Clarke mechanism, which has been successfully applied in the case of one-sided combinatorial auctions, is not budget-balanced when generalized to two-sided auctions. We present a new model for an auction market with autonomous traders and conjunctive combinatorial bids that allows formulation of some fairness properties applicable when pricing is based solely on the buyer’s bids. We then give an example payment allocation algorithm that implements these properties.
CITATION STYLE
Tanner, A., & Mühl, G. (2003). A combinatorial exchange for autonomous traders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2738, pp. 26–36). Springer Verlag. https://doi.org/10.1007/978-3-540-45229-4_4
Mendeley helps you to discover research relevant for your work.