相关论文: Misere quotients for impartial games: Supplementar…

In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…

An expository introduction to bidding chess and other bidding games. To appear in Mathematical Intelligencer.

One approach to deal with the statistical inefficiency of neural networks is to rely on auxiliary losses that help to build useful representations. However, it is not always trivial to know if an auxiliary task will be helpful for the main…

We study arithmetic inequalities for multiplicative, sub(super)-multiplicative, sub(super)-homogeneous functions. Applications for the classical arithmetic functions are pointed out.

We present a new numerical tool to solve partial differential equations involving Caputo derivatives of fractional variable order. Three Caputo-type fractional operators are considered, and for each one of them an approximation formula is…

We consider problems of rating alternatives based on their pairwise comparison under various assumptions, including constraints on the final scores of alternatives. The problems are formulated in the framework of tropical mathematics to…

We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of…

We observe that a significant class of Nash equilibrium problems in non-potential games can be associated with monotone inclusion problems. We propose splitting techniques to solve such problems and establish their convergence. Applications…

Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial…

Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms.…

We propose definitions of substitutes and complements for pieces of information ("signals") in the context of a decision or optimization problem, with game-theoretic and algorithmic applications. In a game-theoretic context, substitutes…

We study an impartial game introduced by Anderson and Harary. The game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected…

In this paper, we introduce some analytical techniques to solve some classes of second order differential equations. Such classes of differential equations arise in describing some mathematical problems in Physics and Engineering.

I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…

This paper considers a stochastic approximation algorithm, with decreasing step size and martingale difference noise. Under very mild assumptions, we prove the non convergence of this process toward a certain class of repulsive sets for the…

The disjunctive sum of impartial games is analyzed by Sprague-Grundy theory. The theory has been extended to loopy games and entailing games by early results. In this study, we consider further extension of this theory and show partial…

We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytically tractable than the standard definition in terms of…

This paper is intended to help the readers to understand the article: Y. Hirashita, Least-Squares Prices of Games, Preprint (arXiv:math.OC/0703079).

We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.

Below, the explicit solution to a certain finite-difference equation is given and the required steps for derivation of these results are outlined. Everything is included as Mathematica formulae, so the notebook itself can be used for…