Results 251 to 260 of about 972,187 (291)
A multi-agent reinforcement learning scheduling algorithm integrating state graph and task graph structural modeling for ride-sharing dispatching. [PDF]
Sci RepSha J, Song M, Sui G, Sun H, Dong D.
europepmc +1 more source
GNN-MA: Soft Molecular Alignment with Cross-Graph Attention for Ligand-Based Virtual Screening. [PDF]
MoleculesLiu K, Wei D, Shi R, Zhou Z.
europepmc +1 more source
Stable schedule matchings [PDF]
Acta 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:
Related searches:
Stable Matching with Network Externalities
Algorithmica, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anshelevich, Elliot +2 more
openaire +2 more sources
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
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
1983
Given a set of men and a set of women, a matching is a set of pairs, each pair containing one man and one woman, such that no person is in more than one pair. We shall be interested in finding matchings satisfying various criteria. The first problem we’ll consider is called the stable marriage problem. We assume that there are the same number of men as
George Pólya +2 more
openaire +1 more source
Given a set of men and a set of women, a matching is a set of pairs, each pair containing one man and one woman, such that no person is in more than one pair. We shall be interested in finding matchings satisfying various criteria. The first problem we’ll consider is called the stable marriage problem. We assume that there are the same number of men as
George Pólya +2 more
openaire +1 more source
Stable Matching with Proportionality Constraints
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017School choice programs seek to give students the option to choose their school but also close an opportunity gap. To be fair in the assignment of students, it is usually argued that the assignment of students to schools should be stable. This second concern is usually expressed in terms of proportions. As an example, in 1989, the city of White Plains,
Thành Nguyen, Rakesh Vohra
openaire +1 more source