Abstract
This paper proposes a new diagram for a specific matching problem: the stable marriage problem. The diagram allows us to elicit not only the structure of with a blocking relation among the nodes representing pairs, but also asymmetry in the actions of the DA algorithm (Gale-Shapley algorithm). Symmetry and asymmetry of the stable marriage problems permit us to deduce strategies of whether or not and when proposals should be made. Some implications to the asymmetry in rewarding and penalty in the game theoretic model are also discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
