Matching with partially ordered contracts

Rashid Farooq, Tamás Fleiner, Akihisa Tamura

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we study a many-to-many matching model with contracts. We extend the economic model of Hatfield and Milgrom by allowing a partial order on the possible bilateral contracts of the agents in a two-sided market economy. To prove that a generalized stable allocation exists, we use generalized form of properties like path-independence and substitutability. The key to our results is thewell-known lattice theoretical fixed point theorem of Tarski. The constructive proof of this fixed point theorem for finite sets turns out to be the appropriate generalization of the Gale-Shapley algorithm also in our general setting.

Original languageEnglish
Pages (from-to)401-417
Number of pages17
JournalJapan Journal of Industrial and Applied Mathematics
Volume29
Issue number3
DOIs
Publication statusPublished - 2012 Oct

Fingerprint

Fixed point theorem
Many to many
Model Matching
Economic Model
Partial Order
Finite Set
Path
Economics
Form
Independence
Generalization
Market

Keywords

  • Gale-Shapley algorithm
  • Lattices
  • Partial orders
  • Stable marriages

ASJC Scopus subject areas

  • Applied Mathematics
  • Engineering(all)

Cite this

Matching with partially ordered contracts. / Farooq, Rashid; Fleiner, Tamás; Tamura, Akihisa.

In: Japan Journal of Industrial and Applied Mathematics, Vol. 29, No. 3, 10.2012, p. 401-417.

Research output: Contribution to journalArticle

Farooq, Rashid ; Fleiner, Tamás ; Tamura, Akihisa. / Matching with partially ordered contracts. In: Japan Journal of Industrial and Applied Mathematics. 2012 ; Vol. 29, No. 3. pp. 401-417.
@article{6ed4793b954c40d9beec24c26fe4c53c,
title = "Matching with partially ordered contracts",
abstract = "In this paper, we study a many-to-many matching model with contracts. We extend the economic model of Hatfield and Milgrom by allowing a partial order on the possible bilateral contracts of the agents in a two-sided market economy. To prove that a generalized stable allocation exists, we use generalized form of properties like path-independence and substitutability. The key to our results is thewell-known lattice theoretical fixed point theorem of Tarski. The constructive proof of this fixed point theorem for finite sets turns out to be the appropriate generalization of the Gale-Shapley algorithm also in our general setting.",
keywords = "Gale-Shapley algorithm, Lattices, Partial orders, Stable marriages",
author = "Rashid Farooq and Tam{\'a}s Fleiner and Akihisa Tamura",
year = "2012",
month = "10",
doi = "10.1007/s13160-012-0073-1",
language = "English",
volume = "29",
pages = "401--417",
journal = "Japan Journal of Industrial and Applied Mathematics",
issn = "0916-7005",
publisher = "Springer Japan",
number = "3",

}

TY - JOUR

T1 - Matching with partially ordered contracts

AU - Farooq, Rashid

AU - Fleiner, Tamás

AU - Tamura, Akihisa

PY - 2012/10

Y1 - 2012/10

N2 - In this paper, we study a many-to-many matching model with contracts. We extend the economic model of Hatfield and Milgrom by allowing a partial order on the possible bilateral contracts of the agents in a two-sided market economy. To prove that a generalized stable allocation exists, we use generalized form of properties like path-independence and substitutability. The key to our results is thewell-known lattice theoretical fixed point theorem of Tarski. The constructive proof of this fixed point theorem for finite sets turns out to be the appropriate generalization of the Gale-Shapley algorithm also in our general setting.

AB - In this paper, we study a many-to-many matching model with contracts. We extend the economic model of Hatfield and Milgrom by allowing a partial order on the possible bilateral contracts of the agents in a two-sided market economy. To prove that a generalized stable allocation exists, we use generalized form of properties like path-independence and substitutability. The key to our results is thewell-known lattice theoretical fixed point theorem of Tarski. The constructive proof of this fixed point theorem for finite sets turns out to be the appropriate generalization of the Gale-Shapley algorithm also in our general setting.

KW - Gale-Shapley algorithm

KW - Lattices

KW - Partial orders

KW - Stable marriages

UR - http://www.scopus.com/inward/record.url?scp=84870953882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870953882&partnerID=8YFLogxK

U2 - 10.1007/s13160-012-0073-1

DO - 10.1007/s13160-012-0073-1

M3 - Article

VL - 29

SP - 401

EP - 417

JO - Japan Journal of Industrial and Applied Mathematics

JF - Japan Journal of Industrial and Applied Mathematics

SN - 0916-7005

IS - 3

ER -