This paper investigates infinitely repeated prisoner-dilemma games where the discount factor is less than but close to 1. We assume that players not only imperfectly but also privately monitor their opponents’ choices of action. We provide a likelihood ratio condition under which there exist Nash equilibrium payoff vectors better than the one-shot Nash equilibrium payoff vector. We show that an...

In this paper, we introduce four new types of the system of generalized vector quasi-equilibrium problems, and establish some new existence results of a solution for the system of vector quasi-equilibrium problems. Mathematics Subject Classification: 90C29, 49J40

Abstract We describe a special class of quasi-equilibrium problems in metric spaces and propose novel simple threshold descent method for solving these problems. Due to the framework, convergence cannot be established with usual convexity or generalized assumptions. Under mild conditions, iterative procedure gives solutions problem. apply this scalar vector some classes relative optimization

We develop a new class of artificial stock market that apply general equilibrium price clearing. Our model is the first multi-asset artificial stock market to use exogenously generated dividends from a geometric vector autoregressive model and is therefore the first truly multi-asset artificial stock market. Our model does not require the concept of a risk free asset and agents are able to form...

The Closest Vector Problem (CVP) is a computational problem on lattices closely related to SVP. (See Shortest Vector Problem.) Given a lattice L and a target point ~x, CVP asks to find the lattice point closest to the target. As for SVP, CVP can be defined with respect to any norm, but the Euclidean norm is the most common (see the entry lattice for a definition). A more relaxed version of the ...

In this paper, we consider more general forms of generalized vector quasi-equilibrium problems for multivalued maps which include many known vector quasi-equilibrium problems and generalized vector quasi-variational inequality problems as special cases. We establish some existence results for solutions of these problems under pseudomonotonicity and u-hemicontinuity/ -hemicontinuity assumptions.

The Shortest Vector Problem (SVP) is the most famous and widely studied computational problem on lattices. Given a lattice L (typically represented by a basis), SVP asks to find the shortest nonzero vector in L. The problem can be defined with respect to any norm, but the Euclidean norm is the most common (see the entry lattice for a definition). A variant of SVP (commonly studied in computatio...

in this paper, we improve some recent coupled fixed point resultsfor single-valued operators in the framework of ordered $b$-metricspaces established by bota et al. [m-f. bota, a. petrusel, g.petrusel and b. samet, coupled fixed point theorems forsingle-valued operators in b-metric spaces, fixed point theoryappl. (2015) 2015:231]. also, we prove that perov-type fixed pointtheorem in ordered gen...