Results 251 to 260 of about 963,583 (273)

Stable schedule matchings [PDF]

open access: possibleActa Mathematica Hungarica, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vilmos Komornik   +2 more
openaire   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

Stable Matching with Network Externalities

Algorithmica, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anshelevich, Elliot   +2 more
openaire   +2 more sources

Stable Matching Problems

2006
Stable matching is one of the oldest problems studied from an algorithmic point of view, whose original version is defined as follows: An instance consists of N men, N women, and each person's preference list. A preference list is a totally ordered list including all members of the opposite sex depending on his/her preference.
openaire   +1 more source

Home - About - Disclaimer - Privacy