Hospitals/Residents Problem

Manlove, David F.

doi:10.1007/978-0-387-30162-4_180

Cited by 11 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Dans ce travail les auteurs proposent un algorithme de mariages stables dans lequel l'objectif est de regrouper des hommes et des femmes deux à deux de manière à respecter au mieux les préférences de tous. Le problème est étendu par le problème hôpitaux/résidents [7,22]. Il est similaire à celui des mariages stables.…”

Section: Choix Social Informatiqueunclassified

ABSG : une architecture d’agents d’inspiration sociale pour le problème de formation de coalitions

Bettinelli¹,

Occello²,

Genthial³

2023

Revue Ouverte d'Intelligence Artificielle

View full text Add to dashboard Cite

show abstract

Section: Choix Social Informatiqueunclassified

ABSG : une architecture d’agents d’inspiration sociale pour le problème de formation de coalitions

Bettinelli¹,

Occello²,

Genthial³

2023

Revue Ouverte d'Intelligence Artificielle

View full text Add to dashboard Cite

show abstract

“…The marriage problem was originally proposed by Gale and Shapley a few decades ago in Economics. The concept, which described a matching solution for elements in two sets of elements given a ranking of preference for each element, was successfully implemented in a real‐life situation; doctor‐hospital assignment in the United States of America in 1962 . The marriage problem is composed by the following two definitions.…”

Section: Person Re‐identification Via the Smamentioning

confidence: 99%

Simultaneous image matching for person re‐identification via the stable marriage algorithm

Hashim

Kawanishi

Deguchi

et al. 2020

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

Recently, multiperson tracking across non-overlapping camera views is gaining increasing attention in the video surveillance field due to its importance for public security. Most existing methods find a correspondence of person images individually across each pair of adjacent two cameras. However, in such a naive approach, redundant matching where one of the person images is selected for the matching pair for several times, often occurs. It leads to tracking failure. To overcome this problem, in this paper, by considering the matching problem as an instance of the "marriage problem" that is well known in Economics, we propose a simultaneous image matching method for multiple persons based on the stable marriage algorithm. We confirmed that the proposed method outperforms some of the existing state-of-the-art methods on several well-known public datasets.

show abstract

Semi‐distributed resource management for underlay D2D communication with user's cooperation

Gour

Tyagi

2019

Int J Communication

View full text Add to dashboard Cite

Device-to-device (D2D) communication is a viable solution proposed by the Third Generation Partnership Project (3GPP) to handle the enormous number of devices and expected data explosion in 5G. It is competent in enhancing the system performances such as increased data rate, reduced delay, and less power consumption while maintaining a low load on the base station (BS). In this paper, channel assignment and power control scheme is proposed for underlay D2D system where one cellular channel is allowed to be shared among multiple D2D pairs. This will lead to enhanced spectral efficiency on the cost of additional interferences introduced among the D2D and cellular users (CUs). Our aim is to maximize the D2D throughput without degrading the performance of existing CU that is sharing the channel with D2D. This is achieved by maintaining a threshold signal-to-interference-plus-noise ratio (SINR) for each CU. A centralized channel assignment algorithm based on the well-known two-sided preference Gale-Shapley algorithm is proposed, named as RAbaGS-HR. Further, suboptimal distributed power control (DPC) algorithms are proposed for both uplink and downlink D2D. The novelty of the work lies in the facts that a channel is shared among multiple D2D users and the optimal power is calculated for all the users sharing the same channel under the full consideration of all kinds of interferences unlike most of the existing work that either assumed the fixed CU power or ignored the interferences among the D2D users. Numerical results show the efficacy of the proposed algorithms in terms of significant gain in throughput with a very low computational cost. In addition to this, the energy efficiency (EE) is also analyzed for different D2D user density, with respect to average circuit power consumption and D2D maximum transmit power.

show abstract

Hospitals/Residents Problem

Cited by 11 publications

References 14 publications

ABSG : une architecture d’agents d’inspiration sociale pour le problème de formation de coalitions

ABSG : une architecture d’agents d’inspiration sociale pour le problème de formation de coalitions

Simultaneous image matching for person re‐identification via the stable marriage algorithm

Semi‐distributed resource management for underlay D2D communication with user's cooperation

Contact Info

Product

Resources

About