Approximate solution of the Duffin-Kemmer-Petiau equation for a vector Yukawa potential with arbitrary total angular momenta

The usual approximation scheme is used to study the solution of the Duffin-Kemmer-Petiau (DKP) equation for a vector Yukawa potential in the framework of the parametric Nikiforov-Uvarov (NU) method. The approximate energy eigenvalue equation and the corresponding wave function spinor components are calculated for arbitrary total angular momentum in closed form. Further, the approximate energy equation and wave function spinor components are also given for case. A set of parameter values is used to obtain the numerical values for the energy states with various values of quantum levelsComment: 17 pages; Communications in Theoretical Physics (2012). arXiv admin note: substantial text overlap with arXiv:1205.0938, and with arXiv:quant-ph/0410159 by other author

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost

Abstract. We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that computes a pure Nash equilibrium with respect to traffic congestion in a network. In this algorithm each user plays only once and allocates her traffic to a path selected via a shortest path computation. We then show that this algorithm works for series-parallel networks when users are identical or when users are of varying demands but have the same best response strategy for any initial network traffic. We also give constructions where the algorithm fails if either the above condition is violated (even for series-parallel networks) or the network is not series-parallel (even for identical users). Thus, we essentially indicate the limits of the applicability of this greedy approach. We also study the price of anarchy for the objective of maximum latency. We prove that for any network of m uniformly related links and log m for identical users, the price of anarchy is Θ(