Related papers: SAT as a game
"Mathematicians, like physicists, are pushed by a strong fascination. Research in mathematics is hard, it is intellectually painful even if it is rewarding, and you would not do it without some strong urge." [D. Ruelle]. We shall give some…
Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) are widely used in automated verification, but there is a lack of interactive tools designed for educational purposes in this field. To address this gap, we present…
Escalation is the fact that in a game (for instance an auction), the agents play forever. It is not necessary to consider complex examples to establish its rationality. In particular, the $0,1$-game is an extremely simple infinite game in…
Many puzzle video games, like Sokoban, involve moving some agent in a maze. The reachable locations are usually apparent for a human player, and the difficulty of the game is mainly related to performing actions on objects, such as pushing…
We introduce a problem set-up we call the Iterated Matching Pennies (IMP) game and show that it is a powerful framework for the study of three problems: adversarial learnability, conventional (i.e., non-adversarial) learnability and…
Despite our familiarity with and fondness of humor, until relatively recently very little was known about the underlying psychology of this complex and nuanced phenomenon. Recently, however, cognitive psychologists have begun investigating…
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…
This paper introduces a novel criterion, persuasiveness, to select equilibria in signaling games. In response to the Stiglitz critique, persuasiveness focuses on the comparison across equilibria. An equilibrium is more persuasive than an…
The video game industry plays an essential role in the entertainment sphere of our society. However, from Monopoly to Flight Simulators, serious games have also been appealing tools for learning a new language, conveying values, or training…
This article contains a selection of problems from the American Mathematics Competitions.
Phase transition is an important feature of SAT problem. For random k-SAT model, it is proved that as r (ratio of clauses to variables) increases, the structure of solutions will undergo a sudden change like satisfiability phase transition…
In a preliminary study of numerical humor, we propose the Perceived Specificity Hypothesis (PSH). The PSH states that, for nonnegative integers < 100, the funniness of a number increases with its apparent precision. A survey of 68…
Security questions are one of the techniques used to recover passwords. The main limitation of security questions is that users find strong answers difficult to remember. This leads users to trade-off security for the convenience of an…
We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…
Recently there have been multiple calls for curricular reforms to develop new pathways to the science, technology, engineering and math (STEM) disciplines. The Marble Game answers these calls by providing a conceptual framework for…
Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specification of a system to be implemented. This paper puts forward a…
Knowing the truth is rarely enough -- we also seek out reasons why the fact is true. While much is known about how we explain contingent truths, we understand less about how we explain facts, such as those in mathematics, that are true as a…
It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow…
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and…
We introduce some preliminaries about game theory and information security. Then surveying a subset of the literature, we identify opportunities for future research.