Maintaining stability for a matching problem under dynamic preference

HIGHLIGHTS

  • who: AKHMAD ALIMUDIN and collaborators from the Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Japan have published the Article: Maintaining Stability for a Matching Problem under Dynamic Preference, in the Journal: (JOURNAL)
  • what: This study investigates two-sided matching and considers dynamic preference. This study proposes a new concept to find stable matching using the blocking pair perspective. The aim of the Gale-Shapley algorithm is to establish stable pairings for all agents involved. The previous research focused on minimizing revision costs when updating a matching.
  • how: In the . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?