Stable schedule matchings by a fixed point method

Details Stable schedule matchings by a fixed point method Stable schedule matchings by a fixed point method

2010-05-12

arxiv.org/abs/1005.2078v1

Mathematics

Optimization and Control

Scientific paper

We generalize several schedule matching theorems of Baiou-Balinski (Math. Oper. Res., 27 (2002), 485) and Alkan-Gale (J. Econ. Th. 112 (2003), 289) by applying a fixed point method of Fleiner (Math. Oper. Res., 28 (2003), 103). Thanks to a more general construction of revealing choice maps we develop an algorithm to solve rather complex matching problems. The flexibility and efficiency of our approach is illustrated by various examples. We also revisit the mathematical structure of the matching theory by comparing various definitions of stable sets and various classes of choice maps. We demonstrate, by several examples, that the revealing property of the choice maps is the most suitable one to ensure the existence of stable matchings; both from the theoretical and the practical point of view.

Affiliated with

Also associated with

No associations

Rating

Stable schedule matchings by a fixed point method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stable schedule matchings by a fixed point method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stable schedule matchings by a fixed point method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499528