Differentially private spectrum auction with approximate revenue maximization
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Dynamic spectrum redistribution---under which spectrum owners lease out under-utilized spectrum to users for financial gain---is an effective way to improve spectrum utilization. Auction is a natural way to incentivize spectrum owners to share their idle resources. In recent years, a number of strategy-proof auction mechanisms have been proposed to stimulate bidders to truthfully reveal their valuations. However, it has been shown that truthfulness is not a necessary condition for revenue maximization. Furthermore, in most existing spectrum auction mechanisms, bidders may infer the valuations---which are private information---of the other bidders from the auction outcome. In this paper, we propose a Differentially privatE spectrum auction mechanism with Approximate Revenue maximization (DEAR). We theoretically prove that DEAR achieves approximate truthfulness, privacy preservation, and approximate revenue maximization. Our extensive evaluations show that DEAR achieves good performance in terms of both revenue and privacy preservation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
Akyildiz, I. F., Lee, W.-Y., Vuran, M. C., & Mohanty, S. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.05.001 · Cited by 6,356
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542
Cited by
DEAL: Differentially Private Auction for Blockchain based Microgrids Energy Trading
Ul Hassan, M., Rehmani, M. H., & Chen, J. (2019) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2019.2947471 · Cited by 276
More Than Privacy: Applying Differential Privacy in Key Areas of Artificial Intelligence
Zhu, T., Ye, D., Wang, W., Zhou, W., & Yu, P. S. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3014246 · Cited by 219
Differential Privacy in Cognitive Radio Networks: A Comprehensive Survey
Ul Hassan, M., Rehmani, M. H., Rehan, M., & Chen, J. (2022) · Cognitive Computation · doi:10.1007/s12559-021-09969-9 · Cited by 19
“[51] proposed DDSM mechanism which is a double auction scheme for differentially private spectrum grouping.”
BackgroundA Novel Privacy-Preserving Incentive Mechanism for Multi-Access Edge Computing
You, F., Yuan, X., Ni, W., & Jamalipour, A. (2024) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2024.3391303 · Cited by 11
Metadata
- Authors
- Zhu, R., Li, Z., Wu, F., Shin, K., & Chen, G.
- Venue
- Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing
- Publisher
- ACM
- Published
- 2014-08-11
- Pages
- 185-194
- OpenAlex
- W2164187475
- Cited by
- 55
- References
- 3
- FWCI
- 10.81
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.