One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences.
Boris G. PittelPublished in: Discret. Appl. Math. (2021)
Keyphrases
- learning algorithm
- dynamic programming
- experimental evaluation
- objective function
- np hard
- cost function
- optimal solution
- particle swarm optimization
- worst case
- computational complexity
- single pass
- improved algorithm
- classification algorithm
- computational cost
- preprocessing
- search algorithm
- multi agent
- linear programming
- decision trees
- randomly generated
- reinforcement learning
- times faster
- matching algorithm
- computationally efficient
- video sequences
- input data
- significant improvement
- high accuracy
- scheduling problem
- mobile robot
- search space
- data sets
- k means