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/

Zendy Plus

Presents the zaia usage as premium feature

ZAIA

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the access of premium content as premium feature

Premium Content

Zendy Tools

Zendy Open

In this work, we study spectrum auction problem where each spectrum usage request has spatial, temporal, and spectral features. After receiving bid requests from secondary users, and possibly reserve price from primary users, our goal is to design truthful mechanisms that will either optimize the social efficiency or optimize the revenue of the primary user. As computing an optimal conflict-free spectrum allocation is an NP-hard problem, in this work, we design near optimal spectrum allocation mechanisms separately based on the techniques: derandomized allocation from integer programming formulation, and its linear programming (LP) relaxation. We theoretically prove that 1) our derandomized allocation methods are monotone, thus, implying truthful auction mechanisms; 2) our derandomized allocation methods can achieve a social efficiency or a revenue that is at least $1-\frac{1}{e}$ times of the optimal respectively; Our extensive simulation results corroborate our theoretical analysis.

Near-optimal truthful spectrum auction mechanisms with spatial and temporal reuse in wireless networks