相关论文: Casse-Briques
Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to…
This paper presents a new and original first approach to agreement situations as well as to regulations constructions. This is made by giving a mathematical formalization to the set of all possible deals or regulations, such that then, the…
This document is both a synthesis of current notions about complex systems, and a practical approach description. A disambiguation is proposed and exposes possible reasons for controversies related to causation and emergence. Theoretical…
This article identifies a gap between the existence of a various psychometric tests approaches and other team performance assessment tools (e.g. business and management games). As a response to the lack of tools able to utilize the…
Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic of research in recent years. In this paper, we initiate the…
In this paper, we study a theoretical math problem of game theory and calculus of variations in which we minimize a functional involving two players. A general relationship between the optimal strategies for both players is presented,…
We describe a class of combinatorial design problems which typically occur in professional sailing league competitions. We discuss connections to resolvable block designs and equitable coverings and to scheduling problems in operations…
This article is devoted to the tactical game theoretical interpretation of dialectics. Dialectical games are considered as abstractly as well as models of the internal dialogue and reflection. The models related to the representation theory…
Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decision-making and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning…
From the standpoint of game theory, dominoes is a game that has not received much attention (specially the variety known as draw). It is usually thought that this game is already solved, given general results in game theory. However, the…
The intended purpose of this work is to provide the reader with a comprehensive, state-of-the art presentation of the theory of complex Hadamard matrices, or at least report on the very recent advances. This manuscript consists of three…
The purpose of this paper is to introduce the idea of triangular Ramsey numbers and provide values as well as upper and lower bounds for them. To do this, the combinatorial game Mines is introduced; after some necessary theorems about…
We build a general theory for characterizing the computational complexity of motion planning of robot(s) through a graph of "gadgets", where each gadget has its own state defining a set of allowed traversals which in turn modify the…
The concept of statistical complexity is studied to characterize the classical kicked top model which plays important role in the qbit systems and the chaotic properties of the entanglement. This allows us to understand this driven…
An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…
A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff…
Usually, to apply game-theoretic methods, we must specify utilities precisely, and we run the risk that the solutions we compute are not robust to errors in this specification. Ordinal games provide an attractive alternative: they require…
Planning in adversarial and uncertain environments can be modeled as the problem of devising strategies in stochastic perfect information games. These games are generalizations of Markov decision processes (MDPs): there are two…
It is shown that under reasonable assumptions a Drake-style equation can be obtained for the probability that our universe is the result of a deliberate simulation. Evaluating loose bounds for certain terms in the equation shows that the…
This paper introduces a simulation algorithm for evaluating the log-likelihood function of a large supermodular binary-action game. Covered examples include (certain types of) peer effect, technology adoption, strategic network formation,…