Many-to-One Matching Markets with Externalities Among Firms

Bando, Keisuke

doi:10.2139/ssrn.1865155

Cited by 24 publications

(45 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To avoid combinatorial complexity in exhausting search, in this section, we propose a low complexity user scheduling algorithm based on matching theory [38], [39]. Given the user power allocation coefficients, the optimization problem (9) can be transformed into which can be formulated as a many to one bipartite matching problem with externalities among users [39]. Based on the concept of stable matching, we will develop a low complexity matching algorithm in the following.…”

Section: B Many-to-one Matching Algorithm For User Schedulingmentioning

confidence: 99%

“…This is a many-to one matching problem. These types of problems have a long history in economics, such as the marriage problem (q m = 1) [38] and workers/firms problem [39] or hospitals/residents problem [40] with q m > 1.…”

Section: ) Preliminaries Of Matching Theory In User Scheduling: Basementioning

confidence: 99%

“…Since externalities exist in the formulated matching problem, it is not straightforward to define a stability concept because a stablility of a matching depends on how a deviating pair expects the reaction of the other agents [39]. To tackle the externalities, the two-sided exchange stability has been introduce in [41].…”

Section: Definitionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal User Scheduling and Power Allocation for Millimeter Wave NOMA Systems

Cui

Liu

Ding

et al. 2018

IEEE Trans. Wireless Commun.

224

196

View full text Add to dashboard Cite

This paper investigates the application of non-orthogonal multiple access (NOMA) in millimeter wave (mmWave) communications by exploiting beamforming, user scheduling and power allocation.Random beamforming is invoked for reducing the feedback overhead of considered systems. A nonconvex optimization problem for maximizing the sum rate is formulated, which is proved to be NPhard. The branch and bound (BB) approach is invoked to obtain the ǫ-optimal power allocation policy, which is proved to converge to a global optimal solution. To elaborate further, a low complexity suboptimal approach is developed for striking a good computational complexity-optimality tradeoff, where matching theory and successive convex approximation (SCA) techniques are invoked for tackling the user scheduling and power allocation problems, respectively. Simulation results reveal that: i) the proposed low complexity solution achieves a near-optimal performance; and ii) the proposed mmWave NOMA systems is capable of outperforming conventional mmWave orthogonal multiple access (OMA) systems in terms of sum rate and the number of served users. Index TermsMillimeter wave (mmWave), non-orthogonal multiple access (NOMA), power allocation, user scheduling J. Cui and P. Fan are with the Institute

show abstract

Section: B Many-to-one Matching Algorithm For User Schedulingmentioning

confidence: 99%

Section: ) Preliminaries Of Matching Theory In User Scheduling: Basementioning

confidence: 99%

See 1 more Smart Citation

Optimal User Scheduling and Power Allocation for Millimeter Wave NOMA Systems

Cui

Liu

Ding

et al. 2018

IEEE Trans. Wireless Commun.

224

196

View full text Add to dashboard Cite

show abstract

“…From (7) and (9), we can see that the utilities depend on the current matching µ and consequently, the preferences of agents are interdependent. Therefore, the preferences of players are not solely based on individuals, but some externalities affect the preferences and matching as well [21]. Let Ψ(N , P) be the set of matchings.…”

Section: Small Cells' Preferencesmentioning

confidence: 99%

A context-aware matching game for user association in wireless small cell networks

Namvar

Saad

Maham

et al. 2014

2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

Small cell networks are seen as a promising technology for boosting the performance of future wireless networks. In this paper, we propose a novel context-aware user-cell association approach for small cell networks that exploits the information about the velocity and trajectory of the users while also taking into account their quality of service (QoS) requirements. We formulate the problem in the framework of matching theory with externalities in which the agents, namely users and small cell base stations (SCBSs), have strict interdependent preferences over the members of the opposite set. To solve the problem, we propose a novel algorithm that leads to a stable matching among the users and SCBSs. We show that the proposed approach can better balance the traffic among the cells while also satisfying the QoS of the users. Simulation results show that the proposed matching algorithm yields significant performance advantages relative to traditional context-unaware approaches.

show abstract

“…Many works have been presented in the literature to solve numerous matching markets in microeconomics such as [21]- [23]. Unlike previous works [21]- [26], the strategy of each player in the proposed matching game is affected by the decisions of its peers.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Clustering and User Association in Wireless Small-Cell Networks With Social Considerations

Ashraf

Bennis

Saad

et al. 2017

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-In this paper, a novel social network-aware user association in wireless small cell networks with underlaid deviceto-device (D2D) communication is investigated. The proposed approach exploits social strategic relationships between user equipments (UEs) and their physical proximity to optimize the overall network performance. This problem is formulated as a matching game between UEs and their serving nodes (SNs) in which, an SN can be a small cell base station (SCBS) or an important UE with D2D capabilities. The problem is cast as a many-to-one matching game in which UEs and SNs rank one another using preference relations that capture both the wireless aspects (i.e., received signal strength, traffic load, etc.) and users' social ties (e.g., UE proximity and social distance). Due to the combinatorial nature of the network-wide UE-SN matching, the problem is decomposed into a dynamic clustering problem in which SCBSs are grouped into disjoint clusters based on mutual interference. Subsequently, an UE-SN matching game is carried out per cluster. The game under consideration is shown to belong to a class of matching games with externalities arising from interference and peer effects due to users social distance, enabling UEs and SNs to interact with one another until reaching a stable matching. Simulation results show that the proposed social-aware user association approach yields significant performance gains, reaching up to 26%, 24%, and 31% for 5-th, 50-th and 95-th percentiles for UE throughputs, respectively, as compared to the classical social-unaware baseline.

show abstract

Many-to-One Matching Markets with Externalities Among Firms

Cited by 24 publications

References 19 publications

Optimal User Scheduling and Power Allocation for Millimeter Wave NOMA Systems

Optimal User Scheduling and Power Allocation for Millimeter Wave NOMA Systems

A context-aware matching game for user association in wireless small cell networks

Dynamic Clustering and User Association in Wireless Small-Cell Networks With Social Considerations

Contact Info

Product

Resources

About