Tight and Effectively Rectangular Game Forms: A Nash Solvable Class

1998 ◽  
Vol 23 (1) ◽  
pp. 1-11 ◽  
Author(s):  
J. Abdou
Keyword(s):  
2010 ◽  
Vol 40 (1) ◽  
pp. 147-177 ◽  
Author(s):  
Nikolai S. Kukushkin
Keyword(s):  

2021 ◽  
Vol 16 (3) ◽  
pp. 53-68
Author(s):  
A.V. SKIPERSKIKH ◽  

The purpose of the research is to present how the carnival element in the regional policy is associated with the legitimating of power. Also made of the current state of the regional political process in some constituent entities of the Russian Federation, characterized by a high degree of carnivalization. As a result, the importance of the practices of the regional elite, resorting to game forms of their own positioning. The legitimacy of the regional power to depend on festive discourse. A routine political process in the constituent entities of the Russia does not evoke public emotions that have a positive effect on the legitimation of power. The demand for the politics of spectacle is also present in municipal political practices in a very dangerous epoch of COVID-19. A social organism that needs emotions, as well as control, does not experience serious transformations. In society penchant for spectacle, as well as the political class in the production of carnival events, there are deep historical roots, as well as the cultural specificity of a particular region. The points out that in the regional political process one can increasingly see accents on festivals. So, the government solves two important problems: the first one is a public request for a show, it is resolved in conditions of a rather unpleasant and unpromising accumulation of negative for the authorities due to the deterioration of the socio-economic situation in general, the second one is the production of the play solves the issues of legitimation regional and municipal authorities.


1974 ◽  
Vol 39 (3) ◽  
pp. 519-548 ◽  
Author(s):  
Stål O. Aanderaa ◽  
Harry R. Lewis

Let Q be the class of closed quantificational formulas ∀x∃u∀yM without identity such that M is a quantifier-free matrix containing only monadic and dyadic predicate letters and containing no atomic subformula of the form Pyx or Puy for any predicate letter P. In [DKW] Dreben, Kahr, and Wang conjectured that Q is a solvable class for satisfiability and indeed contains no formula having only infinite models. As evidence for this conjecture they noted the solvability of the subclass of Q consisting of those formulas whose atomic subformulas are of only the two forms Pxy, Pyu and the fact that each such formula that has a model has a finite model. Furthermore, it seemed likely that the techniques used to show this subclass solvable could be extended to show the solvability of the full class Q, while the syntax of Q is so restricted that it seemed impossible to express in formulas of Q any unsolvable problem known at that time.In 1966 Aanderaa refuted this conjecture. He first constructed a very complex formula in Q having an infinite model but no finite model, and then, by an extremely intricate argument, showed that Q (in fact, the subclass Q2 defined below) is unsolvable ([Aa1], [Aa2]). In this paper we develop stronger tools in order to simplify and extend the results of [Aa2]. Specifically, we show the unsolvability of an apparently new combinatorial problem, which we shall call the linear sampling problem (defined in §1.2 and §2.3). From the unsolvability of this problem there follows the unsolvability of two proper subclasses of Q, which we now define. For each i ≥ 0, let Pi be a dyadic predicate letter and let Ri be a monadic predicate letter.


Games ◽  
2017 ◽  
Vol 8 (4) ◽  
pp. 46 ◽  
Author(s):  
Bezalel Peleg ◽  
Ron Holzman

Filomat ◽  
2017 ◽  
Vol 31 (19) ◽  
pp. 6113-6129 ◽  
Author(s):  
Stevo Stevic ◽  
Bratislav Iricanin ◽  
Zdenk Smarda

It is shown that the following class of systems of difference equations zn+1 = ?zanwbn, wn+1 = ?wcnzdn-2, n ? N0, where a,b,c,d ? Z, ?, ?, z-2, z-1, z0,w0 ? C \ {0}, is solvable, continuing our investigation of classification of solvable product-type systems with two dependent variables. We present closed form formulas for solutions to the systems in all the cases. In the main case, when bd ? 0, a detailed investigation of the form of the solutions is presented in terms of the zeros of an associated polynomial whose coefficients depend on some of the parameters of the system.


Sign in / Sign up

Export Citation Format

Share Document