2008Unpublished venueOpen access

The Core Matchings of Markets with Transfers

Christopher P. Chambers, Federico Echenique

Open full text 2 citations

Abstract

We characterize the structure of the set of core matchings of an assignment game (a two-sided market with transfers). Such a set satisfies a property we call consistency. Consistency of a set of matchings states that, for any matching v, if, for each agent i there exists a matching μ in the set for which μ(i) = v(i), then v is in the set. A set of matchings satisfies consistency if and only if there is an assignment game for which all elements of the set maximize the surplus. We also identify conditions under which we can assume the assignment game has nonnegative values.

About this research paper

What this paper is about

We characterize the structure of the set of core matchings of an assignment game (a two-sided market with transfers). Such a set satisfies a property we call consistency. Consistency of a set of matchings states that, for any matching v, if, for each agent i there exists a matching μ in the set for which μ(i) = v(i), then v is in the set. A set of matchings satisfies consistency if and only if there is an assignment game for which all elements of the set maximize the surplus. We also identify conditions under which we can assume the assignment game has nonnegative values.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We characterize the structure of the set of core matchings of an assignment game (a two-sided market with transfers). Such a set satisfies a property we call consistency. Consistency of a set of matchings states that, for any matching v, if, for each agent i there exists a matching μ in the set for which μ(i) = v(i), then v is in the set. A set of matchings satisfies consistency if and only if there is an assignment game for which all elements of the set maximize the surplus. We also identify conditions under which we can assume the assignment game has nonnegative values.

Key concepts: Core (optical fiber), Consistency (knowledge bases), Set (abstract data type), Matching (statistics), Mathematics, Combinatorics, Property (philosophy), Mathematical economics

Related papers

Back to paper searchBrowse research topicsOriginal source
The Core Matchings of Markets with Transfers — Research Paper | ScholarLens