Quantum game theory is a rapidly evolving subject that extends beyond physics. In this research work, schematic picture of quantum has been provided with the help famous Prisoners’ Dilemma, where both prisoners possess an entangled qubit. Increasing payoffs prisoners, introduces new Nash equilibrium. It considered shared qubits may interact environment, which bath simple harmonic oscillators. T...

We investigate the coexistence of an age optimizing network (AON) and a throughput (TON) that share common spectrum band. consider two modes long run coexistence: (a) networks compete with each other for access, causing them to interfere (b) cooperate achieve non-interfering access. To model competition, we define non-cooperative stage game parameterized by average AON at beginning stage, deriv...

A new synthetic route to mechanochemically produce silicon nanoparticles modified with biocompatible and chromophoric molecular compounds using the Williamson ether synthesis is described. This reaction allows a direct grafting of organic compounds such as phenol, hydroquinone and tetraethylene glycol to the silicon nanoparticle surface in an efficient fashion. Specifically, the formation of (p...

A long march of fifty years successive theoretical progress and new physics discovered using observations gamma-ray bursts, has finally led to the formulation an efficient mechanism able extract rotational energy a Kerr black hole power these most energetic astrophysical sources active galactic nuclei. We here present salient features this long-sought mechanism, based on gravito-electrodynamics...

Consider an extension of the classical model of finite automata operating on finite strings in which the machine simultaneously reads a fixed advice tape — an infinite string A. A deterministic finite-string automaton with advice A is like a deterministic finite-string automaton, except that at step n the next state depends on the current state, the nth symbol of the input w ∈ Σ∗, and the nth s...

This paper explores generalizations of the Goemans-Williamson randomization technique. It establishes a simple equivalence of binary linear feasibility problems and max-cut problems and presents an analysis of the semidefinite max-cut relaxation for the case of a single linear equation. Numerical examples for feasible random binary problems indicate that the randomization technique is efficient...

We examine a competitive market in which producers and consumers are scattered around the economy, linked by a network with finite capacity, along which the good has to be delivered for consumption. A most prominent example would be the deregulated electric power market. Because of the complexity of transaction across the network, the equilibrium allocation is generally complicated. However, we...

Given a social network of users with selection cost and fixed budget, the problem Budgeted Influence Maximization finds subset nodes ( known as seed nodes) for initial activation to maximize influence, such that total is within allocated budget. Existing solution methodologies this make two assumptions, which are not applicable real-life situations. First, an influenced node current time stamp ...