In this paper we seek to account for scalar implicatures and Horn’s division of pragmatic labor in game-theoretical terms by making use mainly of refinements of the standard solution concept of signaling games. Scalar implicatures are accounted for in terms of Farrell’s (1993) notion of a ‘Neologism-Proof’ equilibrium together with Grice’s maxim of Quality. Horn’s division of pragmatic labor is...

We consider two infinite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way infinite path) in G, so that the ray’s labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, prov...

We consider two innnite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way innnite path) in G, so that the ray's labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, provid...

I develop a new game-theoretic approach based, not on conventional Boolean two-valued logic, but instead on linguistic fuzzy logic which admits linguistic truth values. A linguistic fuzzy game is defined with linguistic fuzzy strategies, linguistic fuzzy preferences, and the rules of reasoning and inferences of the game operate according to linguistic fuzzy logic, not Boolean logic. This leads ...

We consider two general frameworks for multiple domination, which are called 〈r, s〉-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple domination. In this paper, known upper bounds for the classical domination are generalised for the 〈r, s〉-domination and parametric domination numbers. These generalisations are based on t...

In the Domination Game, two players, the Dominator and Staller, take turns adding vertices of a fixed graph to a set, at each turn increasing the number of vertices dominated by the set, until the final set A∗ dominates the whole graph. The Dominator plays to minimise the size of the set A∗ while the Staller plays to maximise it. A graph is D-trivial if when the Dominator plays first and both p...

The major factors of insecurity in the East, away from the security of geopolitical area were because of the formation of political management in the nineteenth century colonial style. The security factor in the vast region of the East that encompasses at least three countries of Iran and Afghanistan and Pakistan is very important and highly effective. It reached its peak colonial Anglo-Russian...

Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-eternal domination model. Inequality chains consisting of the domination, eternal domination, m-eternal domination, independence, and clique c...