Tactical games & behavioral self-organization

Denis V. Juriev

Home/Archive/arXiv

arXiv · math/9911147

Tactical games & behavioral self-organization

Denis V. Juriev

View original source ↗Read source document ↗Export metadata ↓

Abstract

The interactive game theoretical approach to tactics and behavioral self-organization is developed. Though it uses the interactive game theoretical formalization of dialogues as psycholinguistic phenomena, the crucial role is played by the essentially new concept of a tactical game. Applications to the perception processes and related subjects (memory, recollection, image understanding, imagination) are discussed together with relations to the computer vision and pattern recognition (the dynamical formation of patterns and perception models during perception as a result of its self-organization) and computer games (modelling of the tactical behavior and self-organization, tactical RPG and elaboration of new tactical game techniques). The appendix is devoted to the operative computer games and the user programming of operative units in a multi-user online operative computer game.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Denis V. Juriev. 1999-11-19. Tactical games & behavioral self-organization. https://arxiv.org/abs/math/9911147

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗