$^3$) problem, aiming to serve the most users and maximize their overall data rate. First, we formulate the DUPA

$^3$

problem and prove its

$\mathcal {NP}$

-completeness. Then, we model the DUPA

$^3$

problem as a potential DUPA

$^3$

game admitting at least one Nash equilibrium and propose a two-phase game-theoretic decentralized algorithm named DUPA

$^3$

Game to achieve the Nash equilibrium as the solution to the DUPA

$^3$

problem. To evaluate DUPA

$^3$

Game, we analyze its theoretical performance and conduct extensive experiments to demonstrate its effectiveness and efficiency.">

Data, User and Power Allocations for Caching in Multi-Access Edge Computing (original) (raw)

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2026 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.