2,024 research outputs found
Matching games with partial information
We analyze different ways of pairing agents in a bipartite matching problem,
with regard to its scaling properties and to the distribution of individual
``satisfactions''. Then we explore the role of partial information and bounded
rationality in a generalized {\it Marriage Problem}, comparing the benefits
obtained by self-searching and by a matchmaker. Finally we propose a modified
matching game intended to mimic the way consumers' information makes firms to
enhance the quality of their products in a competitive market.Comment: 19 pages, 8 fig
Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks
In this paper, we study the resource allocation and user scheduling problem
for a downlink nonorthogonal multiple access network where the base station
allocates spectrum and power resources to a set of users. We aim to jointly
optimize the sub-channel assignment and power allocation to maximize the
weighted total sum-rate while taking into account user fairness. We formulate
the sub-channel allocation problem as equivalent to a many-to-many two-sided
user-subchannel matching game in which the set of users and sub-channels are
considered as two sets of players pursuing their own interests. We then propose
a matching algorithm which converges to a two-side exchange stable matching
after a limited number of iterations. A joint solution is thus provided to
solve the sub-channel assignment and power allocation problems iteratively.
Simulation results show that the proposed algorithm greatly outperforms the
orthogonal multiple access scheme and a previous non-orthogonal multiple access
scheme.Comment: Accepted as a regular paper by IEEE Transactions on Wireless
Communication
An Analysis of the Matching Hypothesis in Networks
The matching hypothesis in social psychology claims that people are more
likely to form a committed relationship with someone equally attractive.
Previous works on stochastic models of human mate choice process indicate that
patterns supporting the matching hypothesis could occur even when similarity is
not the primary consideration in seeking partners. Yet, most if not all of
these works concentrate on fully-connected systems. Here we extend the analysis
to networks. Our results indicate that the correlation of the couple's
attractiveness grows monotonically with the increased average degree and
decreased degree diversity of the network. This correlation is lower in sparse
networks than in fully-connected systems, because in the former less attractive
individuals who find partners are likely to be coupled with ones who are more
attractive than them. The chance of failing to be matched decreases
exponentially with both the attractiveness and the degree. The matching
hypothesis may not hold when the degree-attractiveness correlation is present,
which can give rise to negative attractiveness correlation. Finally, we find
that the ratio between the number of matched couples and the size of the
maximum matching varies non-monotonically with the average degree of the
network. Our results reveal the role of network topology in the process of
human mate choice and bring insights into future investigations of different
matching processes in networks
- …