Backwards-induction outcome in a quantum game

In economics duopoly is a market dominated by two firms large enough to influence the market price. Stackelberg presented a dynamic form of duopoly that is also called `leader-follower' model. We give a quantum perspective on Stackelberg duopoly that gives a backwards-induction outcome same as the Nash equilibrium in static form of duopoly also known as Cournot's duopoly. We find two qubit quantum pure states required for this purpose.Comment: Revised in the light of referee's comments. Latex, 16 pages, 2 figures, To appear in Phy. Rev.

Quantum games with a multi-slit electron diffraction setup

A setup is proposed to play a quantum version of the famous bimatrix game of Prisoners' Dilemma. Multi-slit electron diffraction with each player's pure strategy consisting of opening one of the two slits at his/her disposal are essential features of the setup. Instead of entanglement the association of waves with travelling material objects is suggested as another resource to play quantum games.Comment: Latex, 7 pages, 2 eps figures, submitted to Physics Letters

Simulation of continuous variable quantum games without entanglement

A simulation scheme of quantum version of Cournot's Duopoly is proposed, in which there is a new Nash equilibrium that may be also Pareto optimal without any entanglement involved. The unique property of this simulation scheme is decoherence-free against the symmetric photon loss. Furthermore, we analyze the effects of the asymmetric information on this simulation scheme and investigate the case of asymmetric game caused by asymmetric photon loss. A second-order phase transition-like behavior of the average profits of the firm 1 and firm 2 in Nash equilibrium can be observed with the change of the degree of asymmetry of the information or the degree of "virtual cooperation". It is also found that asymmetric photon loss in this simulation scheme plays a similar role with the asymmetric entangled states in the quantum game. PACS numbers: 02.50.Le, 03.67.-aComment: 7 pages, 4 figures, RevTex, some contents have been revise

Stability of mixed Nash equilibria in symmetric quantum games

In bi-matrix games the Bishop-Cannings theorem of the classical evolutionary game theory does not permit pure evolutionarily stable strategies (ESSs) when a mixed ESS exists. We find the necessary form of two-qubit initial quantum states when a switch-over to a quantum version of the game also changes the evolutionary stability of a mixed symmetric Nash equilibrium.Comment: 8 pages, no figure, to appear in Communications in Theoretical Physic

Quantum Cooperative Games

We study two forms of a symmetric cooperative game played by three players, one classical and other quantum. In its classical form making a coalition gives advantage to players and they are motivated to do so. However in its quantum form the advantage is lost and players are left with no motivation to make a coalition.Comment: Revised in the light of referee's comments. Submitted to Physics Letters A. LaTex, 9 pages, 1 figure. Parts of this paper are rewritte

An Improved Split-Step Wavelet Transform Method for Anomalous Radio Wave Propagation Modelling

Anomalous tropospheric propagation caused by ducting phenomenon is a major problem in wireless communication. Thus, it is important to study the behavior of radio wave propagation in tropospheric ducts. The Parabolic Wave Equation (PWE) method is considered most reliable to model anomalous radio wave propagation. In this work, an improved Split Step Wavelet transform Method (SSWM) is presented to solve PWE for the modeling of tropospheric propagation over finite and infinite conductive surfaces. A large number of numerical experiments are carried out to validate the performance of the proposed algorithm. Developed algorithm is compared with previously published techniques; Wavelet Galerkin Method (WGM) and Split-Step Fourier transform Method (SSFM). A very good agreement is found between SSWM and published techniques. It is also observed that the proposed algorithm is about 18 times faster than WGM and provide more details of propagation effects as compared to SSFM

Quantum repeated games

In a two-stage repeated classical game of prisoners' dilemma the knowledge that both players will defect in the second stage makes the players to defect in the first stage as well. We find a quantum version of this repeated game where the players decide to cooperate in the first stage while knowing that both will defect in the second.Comment: Revised in the light of referee's comments. Latex, 10 pages, 1 eps figure, submitted to Physics Letters

Approximate algorithms for partitioning and assignment problems

The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy