Amanote Research

Amanote Research

    RegisterSign In

Stable Matching With Uncertain Linear Preferences

Algorithmica - United States
doi 10.1007/s00453-019-00650-0
Full Text
Open PDF
Abstract

Available in full text

Categories
Applied MathematicsComputer Science ApplicationsComputer Science
Date

November 14, 2019

Authors
Haris AzizPéter BiróSerge GaspersRonald de HaanNicholas MatteiBaharak Rastegari
Publisher

Springer Science and Business Media LLC


Related search

Uncertain Future Preferences and Conservation

SSRN Electronic Journal
1998English

Pareto Optimal Allocation Under Uncertain Preferences

2017English

A Polynomial-Time Algorithm for a Stable Matching Problem With Linear Valuations and Bounded Side Payments

Japan Journal of Industrial and Applied Mathematics
EngineeringApplied Mathematics
2008English

Efficient Matching of Substrings in Uncertain Sequences

2014English

"Coherent Arbitrariness": Stable Demand Curves Without Stable Preferences

Quarterly Journal of Economics
EconomicsEconometrics
2003English

Robust Solutions of Linear Programming Problems Contaminated With Uncertain Data

Mathematical Programming, Series B
MathematicsSoftware
2000English

Robust Stability Criteria for Uncertain Linear Systems With Time-Delay

Transactions of the Society of Instrument and Control Engineers
1993English

Finite-Time Control for Uncertain Linear Systems With Disturbance Inputs

1999English

Relative Stability of Linear Dynamic Systems With Bounded Uncertain Coefficients

Transactions of the Society of Instrument and Control Engineers
1974English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy