Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Stable schedule matchings by a fixed point method   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.

35
The categories of this paper are: mtrl-th
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
13
The categories of this paper are: quant-ph
1
The categories of this paper are: cs
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
0
The categories of this paper are: hep-ph