English
Related papers

Related papers: Seeking a Game in which the standard model Group s…

200 papers

Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior…

Computer Science and Game Theory · Computer Science 2013-08-19 Kevin Waugh , Brian D. Ziebart , J. Andrew Bagnell

We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which we study, each competitor in a team order plays a match with…

Computer Science and Game Theory · Computer Science 2026-05-21 Haris Aziz , Jiarui Gan , Grzegorz Lisowski , Ali Pourmiri

This is an expository work presenting in detail the proof of the structure theorem for divisible abelian groups. A divisible abelian group is an abelian group that satisfies nD=D for all natural n. The theorem states that any divisible…

Group Theory · Mathematics 2015-06-05 Daniel Miller

We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.

Combinatorics · Mathematics 2012-10-23 Landon Rabern

Given an integer-valued matrix $A$ of dimension $\ell \times k$ and an integer-valued vector $b$ of dimension $\ell$, the Maker-Breaker $(A,b)$-game on a set of integers $X$ is the game where Maker and Breaker take turns claiming previously…

Combinatorics · Mathematics 2018-11-29 Robert Hancock

In this paper, we introduce a framework of new mathematical representation of Game Theory, including static classical game and static quantum game. The idea is to find a set of base vectors in every single-player strategy space and to…

Quantum Physics · Physics 2007-05-23 Jinshan Wu

Winning sets of Schmidt's game enjoy a remarkable rigidity. Therefore, this game (and modifications of it) have been applied to many examples of complete metric spaces (X, d) to show that the set of "badly approximable points", with respect…

Dynamical Systems · Mathematics 2013-09-19 Steffen Weil

Additively separable hedonic games and fractional hedonic games have received considerable attention. They are coalition forming games of selfish agents based on their mutual preferences. Most of the work in the literature characterizes the…

Artificial Intelligence · Computer Science 2017-06-29 Michele Flammini , Gianpiero Monaco , Qiang Zhang

Given a group $G$ and an integer $n\geq2$ we construct a new group $\tilde{{\cal K}}(G,n)$. Although this construction naturally occurs in the context of finding new invariants for complex algebraic surfaces, it is related to the theory of…

Group Theory · Mathematics 2008-05-20 Christian Liedtke

Symmetries of the finite Heisenberg group represent an important tool for the study of deeper structure of finite-dimensional quantum mechanics. As is well known, these symmetries are properly expressed in terms of certain normalizer. This…

Quantum Physics · Physics 2011-01-24 M. Korbelar , J. Tolar

We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winner of a tournament after observing round-robin play among…

Computer Science and Game Theory · Computer Science 2025-12-08 David Pennock , Daniel Schoepflin , Kangning Wang

We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…

Computer Science and Game Theory · Computer Science 2026-02-18 Rafael Frongillo , Melody Hsu , Mary Monroe , Anish Thilagar

In this paper, we discover that the class of random polynomials arising from the equilibrium analysis of random asymmetric evolutionary games is \textit{exactly} the Kostlan-Shub-Smale system of random polynomials, revealing an intriguing…

Probability · Mathematics 2024-10-03 Manh Hong Duong , The Anh Han

A new representation of Game Theory is developed in this paper. State of players is represented by a density matrix, and payoff function is a set of hermitian operators, which when applied onto the density matrix give the payoff of players.…

Quantum Physics · Physics 2007-05-23 Jinshan Wu

At some places (see the references) Martin Erickson describes a certain game: "Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy four cells…

Discrete Mathematics · Computer Science 2012-05-22 Thomas Jenrich

We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…

Physics and Society · Physics 2007-08-29 Dmitriy Cherkashin , J. Doyne Farmer , Seth Lloyd

The multiplication game is a two-person game in which each player chooses a positive integer without knowledge of the other player's number. The two numbers are then multiplied together and the first digit of the product determines the…

Computer Science and Game Theory · Computer Science 2016-07-11 Kent E. Morrison

Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter…

Computer Science and Game Theory · Computer Science 2019-06-11 Abel Molina

The Optional Public Goods Game is a three-strategy game in which an individual can play as a cooperator or defector or decide not to participate. Despite its simplicity, this model can effectively represent many human social dilemmas, such…

We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately claim unclaimed edges. It is Maker's goal to have after…

Combinatorics · Mathematics 2024-12-23 Nathan Bowler , Florian Gut
‹ Prev 1 4 5 6 7 8 10 Next ›