The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Incentive Mechanisms for Federated Learning: From Economic and Game Theoretic Perspective
Open accessAbstract
Federated learning (FL) becomes popular and has shown great potentials in training large-scale machine learning (ML) models without exposing the owners’ raw data. In FL, the data owners can train ML models based on their local data and only send the model updates rather than raw data to the model owner for aggregation. To improve learning performance in terms of model accuracy and training completion time, it is essential to recruit sufficient participants. Meanwhile, the data owners are rational and may be unwilling to participate in the collaborative learning process due to the resource consumption. To address the issues, there have been various works recently proposed to motivate the data owners to contribute their resources. In this paper, we provide a comprehensive review for the economic and game theoretic approaches proposed in the literature to design various schemes for incentivizing data owners to participate in FL training process. In particular, we first present the fundamentals and background of FL, economic theories commonly used in incentive mechanism design. Then, we review applications of game theory and economic approaches applied for incentive mechanisms design of FL. Finally, we highlight some open issues and future research directions concerning incentive mechanism design of FL.
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
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215
17. A Value for n-Person Games
Shapley, L. S. (1953) · Contributions to the Theory of Games (AM-28), Volume II · doi:10.1515/9781400881970-018 · Cited by 6,950
Federated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
Self-citationA tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647
A Survey of Deep Learning: Platforms, Applications and Emerging Research Trends
Hatcher, W. G., & Yu, W. (2018) · IEEE Access · doi:10.1109/access.2018.2830661 · Cited by 654
DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-based Incentive
Weng, J., Weng, J., Zhang, J., Li, M., Zhang, Y., & Luo, W. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2952332 · Cited by 610 · cited 1×
“Meanwhile, some works studied the incentive mechanisms tackling the encrypted model parameters such as [19], [157], which provide a promising research direction of incentive mechanism design for FL.”
BackgroundSelf-citationA Learning-Based Incentive Mechanism for Federated Learning
Zhan, Y., Li, P., Qu, Z., Zeng, D., & Guo, S. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2967772 · Cited by 602
Federated Learning for Edge Networks: Resource Optimization and Incentive Mechanism
Khan, L. U., Pandey, S. R., Tran, N. H., Saad, W., Han, Z., Nguyen, M. N. H., & Hong, C. S. (2020) · IEEE Communications Magazine · doi:10.1109/mcom.001.1900649 · Cited by 506
Cited by
Chen, J., Yi, C., Okegbile, S. D., Cai, J., & Shen, X. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3308717 · Cited by 254
Fu, Y., Li, C., Yu, F. R., Luan, T. H., & Zhao, P. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3297996 · Cited by 96
Metadata
- Authors
- Tu, X., Zhu, K., Luong, N. C., Niyato, D., Zhang, Y., & Li, J.
- Venue
- IEEE Transactions on Cognitive Communications and Networking
- Published
- 2022-09
- Volume
- 8
- Issue
- 3
- Pages
- 1566-1593
- ISSN
- 2332-7731 (ISSN-L)
- 2372-2045
- OpenAlex
- W3215200847
- Cited by
- 174
- References
- 17
- FWCI
- 11.79
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Incentive Mechanisms for Federated Learning: From Economic and Game Theoretic Perspective. https://app.cochat.ai/papers/10.1109/tccn.2022.3177522
- The paper
- Tu, X., Zhu, K., Luong, N. C., Niyato, D., Zhang, Y., & Li, J. (2022). Incentive Mechanisms for Federated Learning: From Economic and Game Theoretic Perspective. IEEE Transactions on Cognitive Communications and Networking. https://doi.org/10.1109/tccn.2022.3177522
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.