The Impact of Psychological Traits on Performance Under Pressure—Experimental Evidence of Handball Penalties

Our field experiment analyzes the influence of psychological traits on performance in sequential games. It uses handball penalties thrown under individual, team, or tournament incentives in the ABBA sequence. Considering the single moves of these games, player A and player B are taking turns in being the first-mover. We find no significant first-mover advantage. However, we observe that player A performs better than player B under tournament incentives and if he or she is confident enough.

Analysis on the Production and Marketing Strategies of Oligopoly Companies Based on Cournot Model and Stackelberg Model

By comparing Cournot model and Stackelberg model under complete information market and Cournot model under incomplete information market, this paper analyzes the impact that manufacturer choose simultaneous or sequential games when determining the amount of output as well as the production and marketing strategy to maximize the profit of the manufacturers in the oligopoly market. A specific analysis is also conducted according to Gree air-conditioning manufacturer’s data.

Double-Oracle Sampling Method for Stackelberg Equilibrium Approximation in General-Sum Extensive-Form Games

The paper presents a new method for approximating Strong Stackelberg Equilibrium in general-sum sequential games with imperfect information and perfect recall. The proposed approach is generic as it does not rely on any specific properties of a particular game model. The method is based on iterative interleaving of the two following phases: (1) guided Monte Carlo Tree Search sampling of the Follower's strategy space and (2) building the Leader's behavior strategy tree for which the sampled Follower's strategy is an optimal response. The above solution scheme is evaluated with respect to expected Leader's utility and time requirements on three sets of interception games with variable characteristics, played on graphs. A comparison with three state-of-the-art MILP/LP-based methods shows that in vast majority of test cases proposed simulation-based approach leads to optimal Leader's strategies, while excelling the competitive methods in terms of better time scalability and lower memory requirements.

Monoidal-closed categories of tree automata

This paper surveys a new perspective on tree automata and Monadic second-order logic (MSO) on infinite trees. We show that the operations on tree automata used in the translations of MSO-formulae to automata underlying Rabin’s Tree Theorem (the decidability of MSO) correspond to the connectives of Intuitionistic Multiplicative Exponential Linear Logic (IMELL). Namely, we equip a variant of usual alternating tree automata (that we call uniform tree automata) with a fibered monoidal-closed structure which in particular handles a linear complementation of alternating automata. Moreover, this monoidal structure is actually Cartesian on non-deterministic automata, and an adaptation of a usual construction for the simulation of alternating automata by non-deterministic ones satisfies the deduction rules of the !(–) exponential modality of IMELL. (But this operation is unfortunately not a functor because it does not preserve composition.) Our model of IMLL consists in categories of games which are based on usual categories of two-player linear sequential games called simple games, and which generalize usual acceptance games of tree automata. This model provides a realizability semantics, along the lines of Curry–Howard proofs-as-programs correspondence, of a linear constructive deduction system for tree automata. This realizability semantics, which can be summarized with the slogan “automata as objects, strategies as morphisms,” satisfies an expected property of witness extraction from proofs of existential statements. Moreover, it makes it possible to combine realizers produced as interpretations of proofs with strategies witnessing (non-)emptiness of tree automata.