Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0106140 · Physica A Statistical Mechanics and its Applications

Quantum bargaining games

Edward W. Piotrowski, Jan Sładkowski

Published May 1, 2002• 43 citations
arXivHTMLPDF
DOI
10.1016/s0378-4371(02)00592-7

Related papers

Quantum game theory

Taksu Cheon

•Jun 1, 2011•0 citations

Quantum Bargaining Games

Piotrowski, Edward W., Sładkowski, Jan

We continue the analysis of quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory and quantum computing. The present paper is devoted to quantum bargaining games which are a special class of quantum market games without institutionalized clearinghouses.

•Jun 25, 2001•36 citations

Cooperative jammer power allocation — A Nash bargaining solution method

Bowen Duan, Yueming Cai, Jianchao Zheng +1 more

In this paper, we investigate a multi-source multi-destination wireless communication network in the presence of an eavesdropper and a cooperative jammer. Nash bargaining solution (NBS) is introduced to investigate the negotiation among the sources on jammer power allocation. In order to improve the network sum-secrecy-rate and maintain sources' fairness at the same time, the optimization problem is formulated as a Nash bargaining game (NBG), which is proved to be a convex optimization problem. The effect of bargaining power selection on sum-secrecy-rate and sources' fairness is investigated analytically and a simple but efficient centralized algorithm is proposed to implement the NBS-based scheme. Simulation results validate the effectiveness and fairness of our proposed scheme.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2015•4 citations

Quantum cooperative games

Azhar Iqbal, A. H. Toor

arXiv:quant-ph/0108091•Physics Letters A•Jan 1, 2002•57 citations

Game Theory for Physical Layer Security on Interference Channels

Xiangyun Zhou, Lingyang Song, Yan Zhang

In this chapter, we propose game-theoretic models for resource allocation in interference channels with physical layer security. Three two-user interference channel scenarios are studied: the peaceful system with public messages, the case with private messages and forward secrecy, and the case with a public feedback channel. These lead to achievable rate, achievable secrecy, and achievable secret-key regions. Next, the outcome of a strategic game in normal form is computed and it is shown that either there exists an equilibrium in dominant strategies or a Nash equilibrium. Finally, three cooperative game models are applied: the Nash bargaining solution, a strategic bargaining algorithm, and the Walrasian market model. They are applicable to all three interference channel scenarios. Numerical illustrations show the utility regions and the outcomes from the different game models are discussed.

CRC Press eBooks•Nov 7, 2013•0 citations

On collective quantum games

Ramón Alonso‐Sanz

Quantum Information Processing•Jan 19, 2019•6 citations
In this paper, we investigate a multi-source multi-destination wireless communication network in the presence of an eavesdropper and a cooperative jammer. Nash bargaining solution (NBS) is introduced to investigate the negotiation among the sources on jammer power allocation. In order to improve the network sum-secrecy-rate and maintain sources' fairness at the same time, the optimization problem is formulated as a Nash bargaining game (NBG), which is proved to be a convex optimization problem. The effect of bargaining power selection on sum-secrecy-rate and sources' fairness is investigated analytically and a simple but efficient centralized algorithm is proposed to implement the NBS-based scheme. Simulation results validate the effectiveness and fairness of our proposed scheme.
In this chapter, we propose game-theoretic models for resource allocation in interference channels with physical layer security. Three two-user interference channel scenarios are studied: the peaceful system with public messages, the case with private messages and forward secrecy, and the case with a public feedback channel. These lead to achievable rate, achievable secrecy, and achievable secret-key regions. Next, the outcome of a strategic game in normal form is computed and it is shown that either there exists an equilibrium in dominant strategies or a Nash equilibrium. Finally, three cooperative game models are applied: the Nash bargaining solution, a strategic bargaining algorithm, and the Walrasian market model. They are applicable to all three interference channel scenarios. Numerical illustrations show the utility regions and the outcomes from the different game models are discussed.