A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A matching game approach for resource allocation in wireless network virtualization
2017
Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication - IMCOM '17
Preserved Fulltext
However, the infrastructure provider is required to employ an efficient resource allocation technique to dynamically allocate the resources for the users associated with different network operators. ...
In this paper, a matching game based solution is proposed for resource allocation in OFDMA virtualized wireless network. ...
The InP wants to maximize its revenue by setting the right VR price to satisfy the demand of VNOs while guarantees the contracts agreements, i.e., minimum required bandwidth. ...
doi:10.1145/3022227.3022339
fatcat:b5acvk5y5bhnlehjqcbl2rnyai
Lightweight QoE Driven and Invulnerability Guarantee Opportunistic Control Scheme for Wireless Sensor Networks
2016
International Journal of Online Engineering (iJOE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
According to user needs, the quality of the network, survivable ability of wireless communication terminal and wireless communication survivability requirements, we proposed three matching rules by considering ...
This paper proposed the lightweight QoE driven adaptive invulnerability wireless communication control method, including the wireless communication terminal equipment with invulnerability antenna. ...
A novel architecture was proposed by Lin K et.al [9] for guaranteeing 5G spectrum management based on the various requirements for QoE as the design objective. ...
doi:10.3991/ijoe.v12i08.5726
fatcat:sk3jiit6kzc5fbo3wc7kgm2fpu
A Novel Collaborative Cognitive Dynamic Network Architecture
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
for data and spectrum trading with low complexity, and enable self-organizing capabilities. ...
A case study with a new resource allocation problem enabled by CDNA is conducted using matching theory with pricing to illustrate the potential benefits of CDNA for users and operators, tackle user associations ...
To fully exploit its potential, a distributed matching algorithm is developed for resource allocation, which allows the users to self-organize into a stable matching for data and spectrum trading. ...
arXiv:1610.02895v1
fatcat:ewmmxu7narcfrpapbegzwki3vm
Cooperative Spectrum Sharing Between D2D Users and Edge-Users: A Matching Theory Perspective
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Different from the conventional equilibrium point evaluation, the stable matching between D2D users and CEUs are formulated under matching theory framework instead. ...
Therefore, it is important to design a spectrum sharing scheme, under which the performance of both links can be improved simultaneously. ...
The stable matching for marriage market always exists [13] , [15] . ...
arXiv:1811.00732v1
fatcat:owejrlp7m5atvfu2f5jihshuxa
BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We prove the solution produced by BLMA will converge to an ϵ-pairwise stable outcome with probability one. We then consider a matching problem in cognitive radio networks. ...
We consider a two-sided matching problem with a defined notion of pairwise stability. We propose a distributed blind matching algorithm (BLMA) to solve the problem. ...
INTRODUCTION The assignment game is a model for a two-sided matching market with transferable linear utilities [1] . ...
arXiv:1605.00306v1
fatcat:c4kn54ko65a3difqlodnabzkua
Matching Theory as Enabler of Efficient Spectrum Management in 5G Networks
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The two proposed versions of utility functions for each set aim at maximizing the satisfaction of both sets with conflicting interests and improving the overall spectrum efficiency. ...
This paper analyzes the spectrum trading problem in virtualized fifth generation (5G) networks in order to enhance the network performance with respect to the spectrum utilization. ...
Each MVNO announces its minimum amount of
spectrum needed,
( , ), and price
capable of paying to lease it,
( , ), for all
M required sets. ...
doi:10.5281/zenodo.3529556
fatcat:35h5eh2xubgahn324v3aqgscxi
Many-to-one blind matching for device-to-device communications
2017
2017 IEEE 56th Annual Conference on Decision and Control (CDC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We show that the random and decentralized process of BLMA converges to ǫ-pairwise stable solutions with probability one. ...
We formulate a two-sided many-to-one abstract matching problem defined by a collection of agreement functions. We then propose a blind matching algorithm (BLMA) to solve the problem. ...
Figure 1 shows the resulting performance of BLMA for different minimum rate requirements by the CUs. ...
doi:10.1109/cdc.2017.8264397
dblp:conf/cdc/HamzaS17
fatcat:h4ogdjo5fjg7rkrifec7tjszei
BLMA: A Blind Matching Algorithm With Application to Cognitive Radio Networks
2017
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. ...
We propose a simple BLMA negotiation and aspiration update dynamic to produce an ǫ-pairwise stable solution for the case of quasi-convex and quasi-concave utilities. ...
with minimum information exchange. ...
doi:10.1109/jsac.2017.2659098
fatcat:jxqro724rzcvzjpvuxbwz2guom
Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We describe our experience with designing and running a matching market for the Israeli "Mechinot" gap-year programs. ...
Our contribution extends the existing toolbox for two-sided matching with soft constraints. ...
for deciding whether a stable matching exists. ...
arXiv:1905.00364v2
fatcat:ldduvzexwbctvgh3kvvuowkgwy
A Two-Layer, Energy-Efficient Approach for Joint Power Control and Uplink–Downlink Channel Allocation in D2D Communication
2020
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this study, we proposed a power control and channel allocation scheme for the EE maximization of the D2D pairs, while jointly reusing uplink–downlink resources and guaranteeing the cellular users' ( ...
The simulation results verified the theoretical analysis and proved that the proposed algorithm could remarkably improve the EE of D2D pairs while guaranteeing the QoS of the CUs. ...
This was because, as the number of D2D links increased, each D2D pair found it more difficult to match with a better partner in a limited matching market. ...
doi:10.3390/s20113285
pmid:32526917
pmcid:PMC7420231
fatcat:a2w65hlrcnh77m576bs7fvrn5y
Peer Effects and Stability in Matching Markets
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Further, research has shown that externalities lead to serious problems for market stability and for developing efficient algorithms to find stable matchings. ...
To characterize the efficiency of matching markets with externalities, we provide general bounds on how far the welfare of the worst-case stable matching can be from the welfare of the optimal matching ...
We begin by focusing on the existence of two-sided exchange-stable matchings. In most prior work, matching markets with externalities do not have guaranteed existence of a stable matching. ...
doi:10.1007/978-3-642-24829-0_12
fatcat:uthlp2gnvncmzdcpt5thl7ynbe
The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics
2002
Econometrica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2001; you can also visit the original URL.
The file type is application/pdf.
Drawing primarily on the design of the entry level labor market for American doctors (the National Resident Matching Program), and on the design of the auctions of radio spectrum conducted by the Federal ...
Designers therefore cannot work only with the simple conceptual models used for theoretical insights into the general working of markets. Instead, market design calls for an engineering approach. ...
The optimal stable matching for one side of the market is the least preferred stable matching for the other side (Gale and Shapley, 1962; Roth and Sotomayor, 1989) . Theorem 3. ...
doi:10.1111/1468-0262.00335
fatcat:d4ldhebj4rfpndbxvpky3jkdbu
Data and Spectrum Trading Policies in a Trusted Cognitive Dynamic Network
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A novel matching-with-pricing algorithm is presented to enable self-organized SU-PU associations, channel allocation and pricing for data and spectrum with low computational complexity. ...
CDNA creates opportunities for capacity increase by network-wide harvesting of unused data plans and spectrum from different operators. ...
a stable matching that guarantees their connectivity requirements. ...
arXiv:1809.08805v1
fatcat:5zs7hct36rcj7pavpds7uks3vy
Bayesian Hierarchical Mechanism Design for Cognitive Radio Networks
2015
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose a distributed algorithm that results in a stable forest matching structure which coincides with the optimal Bayesian Nash equilibrium of the DSA game. ...
In this market, a set of SUs can be first matched to a set of operators and the SUs matched to the same operator can then be matched to the corresponding sub-bands. ...
Note that in the forest matching market, for each agent D k , being matched with a root i cannot guarantee that it will also be matched with a leaf in S i , i.e., even if D k satisfies M o (D k ) ̸ = D ...
doi:10.1109/jsac.2014.2361092
fatcat:mwfnqxw7p5cchgqr3kogwunm3u
Smart Contract-based Spectrum Sharing Transactions for Multi-Operators Wireless Communication Networks
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To address these challenges, a permissioned blockchain trust framework is proposed for the spectrum sharing in multi-OPs wireless communication networks in this paper. ...
Multiple-operators (multi-OPs) spectrum sharing mechanism can effectively improve the spectrum utilization in fifth-generation (5G) wireless communication networks. ...
The second sub-stage is mainly designed for OPs who fail to match in the stage of spectrum auction and provides a free-trading market for unsuccessfully matched OPs. ...
doi:10.1109/access.2020.2992385
fatcat:c3wzepfyindc3nf6vwgzz23j7e
« Previous
Showing results 1 — 15 out of 21,920 results