MétaCan
Menu
Back to cohort
Record W2372440949 · doi:10.1287/opre.2016.1509

Competitive Equilibria in Two-Sided Matching Markets with General Utility Functions

2016· article· en· W2372440949 on OpenAlexaff
Saeed Alaei, Kamal Jain, Azarakhsh Malekian

Bibliographic record

VenueOperations Research · 2016
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicGame Theory and Voting Systems
Canadian institutionsUniversity of Toronto
FundersMicrosoft ResearchNational Science Foundation
KeywordsMathematical proofCompetitive equilibriumCharacterization (materials science)Mathematical economicsConstructiveMatching (statistics)Point (geometry)Perfect competitionComplete latticeCompetition (biology)EconomicsMathematicsComputer scienceMicroeconomics

Abstract

fetched live from OpenAlex

We present an exact characterization of utilities in competitive equilibria of two-sided matching markets in which the utility of each agent depends on the choice of partner and the terms of the partnership, potentially including monetary transfer. Examples of such markets include sellers and buyers or jobs and workers. Demange and Gale showed that the set of competitive equilibria in this type of market forms a complete lattice with each extreme point of the lattice representing an equilibrium with the highest utilities for the agents on one side and the lowest utilities for the agents on the opposite side. Our characterization is based on establishing a connection between the competitive equilibria of a market and the competitive equilibria of certain strict subsets of that market—each obtained by removing exactly one agent. This characterization captures the effect of competition when agents are added to the market or removed from the market. It gives a precise procedure for constructing competitive equilibria and provides a constructive proof of existence of such equilibria; in contrast, previous proofs have been based on fixed point theorems.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.003
Scholarly communication0.0030.005
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0060.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.097
GPT teacher head0.341
Teacher spread0.244 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations21
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueOperations ResearchSame topicGame Theory and Voting SystemsFrench-language works237,207