Amanote Research

Amanote Research

    RegisterSign In

Many-To-One Stable Matching: Geometry and Fairness

Mathematics of Operations Research - United States
doi 10.1287/moor.1060.0207
Full Text
Open PDF
Abstract

Available in full text

Categories
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
Date

August 1, 2006

Authors
Jay SethuramanChung-Piaw TeoLiwen Qian
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)


Related search

Many-To-One Matching: Externalities and Stability

2020English

One-To-Many Node Matching Between Complex Networks

Advances in Complex Systems
ControlSystems EngineeringMultidisciplinary
2010English

Single Agents and the Set of Many-To-One Stable Matchings

Journal of Economic Theory
EconomicsEconometrics
2000English

Many-To-Many Graph Matching: A Continuous Relaxation Approach

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On Stable Solutions of the One- And Two-Sided Model Matching Problems

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
1989English

Many-To-One Boundary Labeling With Backbones

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

One-To-Many Registration of Landsat Imagery

ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
2013English

Existence and Many-One Identity

Philosophical Quarterly
Philosophy
2013English

Matching and Stable Cutsets in Graphs.

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy