Revealed Preferences for Matching with Contracts
Daniel Lehmann

TL;DR
This paper introduces a framework for analyzing many-to-many matching with contracts using revealed preferences, presenting an algorithm for finding stable agreements with desirable properties and exploring their relation to market equilibria.
Contribution
It generalizes existing algorithms to a broader setting, proves the lattice structure of stable agreements, and connects stable agreements to market solutions with prices.
Findings
Algorithm finds stable agreements in linear steps
Stable agreements form a lattice under inverse preferences
Stable agreements encompass and extend competitive equilibria
Abstract
Many-to-many matching with contracts is studied in the framework of revealed preferences. All preferences are described by choice functions that satisfy natural conditions. Under a no-externality assumption individual preferences can be aggregated into a single choice function expressing a collective preference. In this framework, a two-sided matching problem may be described as an agreement problem between two parties: the two parties must find a stable agreement, i.e., a set of contracts from which no party will want to take away any contract and to which the two parties cannot agree to add any contract. On such stable agreements each party's preference relation is a partial order and the two parties have inverse preferences. An algorithm is presented that generalizes algorithms previously proposed in less general situations. This algorithm provides a stable agreement that is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Auction Theory and Applications · Logic, Reasoning, and Knowledge
