English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Treating the interference as noise in the n-user interference channel, thepaper describes a novel approach to the rates region, composed by thetime-sharing convex hull of 2^n-1 corner points achieved through On/Off binarypower control. The resulting rates region is denoted crystallized rates region.By treating the interference as noise, the n-user rates region frontiers hasbeen found in the literature to be the convex hull of n hyper-surfaces. Therates region bounded by these hyper-surfaces is not necessarily convex, andthereby a convex hull operation is imposed through the strategy oftime-sharing. This paper simplifies this rates region in the n-dimensionalspace by having only an On/Off binary power control. This consequently leads to2^n-1 corner points situated within the rates region. A time-sharing convexhull is imposed onto those corner points, forming the crystallized ratesregion. The paper focuses on game theoretic concepts to achieve thatcrystallized convex hull via correlated equilibrium. In game theory, thecorrelated equilibrium set is convex, and it consists of the time-sharing mixedstrategies of the Nash equilibriums. In addition, the paper considers amechanism design approach to carefully design a utility function, particularlythe Vickrey-Clarke-Groves auction utility, where the solution point is situatedon the correlated equilibrium set. Finally, the paper proposes a self learningalgorithm, namely the regret-matching algorithm, that converges to the solutionpoint on the correlated equilibrium set in a distributed fashion.

Crystallized Rates Region of the Interference Channel via Correlated Equilibrium with Interference as Noise