English
Related papers

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

200 papers

The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include, as subclasses, the scoring games considered by Milnor…

Combinatorics · Mathematics 2015-06-01 Urban Larsson , João P. Neto , Richard J. Nowakowski , Carlos P. Santos

Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indicated domination game. It is played on an arbitrary graph $G$…

Combinatorics · Mathematics 2024-03-28 Boštjan Brešar , Csilla Bujtás , Vesna Iršič , Douglas F. Rall , Zsolt Tuza

Motivated by empirical evidence that individuals within group decision making simultaneously aspire to maximize utility and avoid inequality we propose a criterion based on the entropy-norm pair for geometric selection of strict Nash…

Physics and Society · Physics 2020-03-23 A. B. Leoneti , G. A. Prataviera

We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…

Computer Science and Game Theory · Computer Science 2016-05-16 Georgios Amanatidis , Georgios Birmpas , Evangelos Markakis

Two prominent objectives in social choice are utilitarian - maximizing the sum of agents' utilities, and leximin - maximizing the smallest agent's utility, then the second-smallest, etc. Utilitarianism is typically computationally easier to…

Computer Science and Game Theory · Computer Science 2025-09-29 Eden Hartman , Yonatan Aumann , Avinatan Hassidim , Erel Segal-Halevi

The paper is devoted to dynamic games. We consider a general enough framework, which is not limited to e.g. differential games and could accommodate both discrete and continuous time. Assuming common dynamics, we study two game families…

Optimization and Control · Mathematics 2018-04-25 Dmitry Khlopin

We analyze the domination game, where two players, Dominator and Staller, construct together a dominating set M in a given graph, by alternately selecting vertices into M. Each move must increase the size of the dominated set. The players…

Data Structures and Algorithms · Computer Science 2016-03-04 Neta Marcus , David Peleg

We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…

Computer Science and Game Theory · Computer Science 2015-09-18 Martin Gairing , Rahul Savani

We show, using acylindrical hyperbolicity, that a finitely generated group splitting over $\Z$ cannot be simple. We also obtain SQ-universality in most cases, for instance a balanced group (one where if two powers of an infinite order…

Group Theory · Mathematics 2016-03-21 J. O. Button

The general aim of this paper is to extend the Modal-Hamiltonian interpretation of quantum mechanics to the case of relativistic quantum mechanics with gauge U(1) elds. In this case we propose that the actual- valued observables are the…

Quantum Physics · Physics 2010-12-07 Juan Sebastián Ardenghi , Mario Castagnino , Olimpia Lombardi

The uncertainty principle can be understood as constraining the probability of winning a game in which Alice measures one of two conjugate observables, such as position or momentum, on a system provided by Bob, and he is to guess the…

Quantum Physics · Physics 2017-07-06 Joseph M. Renes

According to Shapley's game-theoretical result, there exists a unique game value of finite cooperative games that satisfies axioms on additivity, efficiency, null-player property and symmetry. The original setting requires symmetry with…

Computer Science and Game Theory · Computer Science 2013-08-29 Ales Antonin Kubena , Peter Franek

In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker…

Combinatorics · Mathematics 2015-03-17 Edgar Fisher , Nandor Sieben

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…

General Finance · Quantitative Finance 2009-02-09 Dmitriy Cherkashin , J. Doyne Farmer , Seth Lloyd

We study two-player general sum repeated finite games where the rewards of each player are generated from an unknown distribution. Our aim is to find the egalitarian bargaining solution (EBS) for the repeated game, which can lead to much…

Machine Learning · Computer Science 2019-06-05 Aristide Tossou , Christos Dimitrakakis , Jaroslaw Rzepecki , Katja Hofmann

We study a class of probabilistic cooperative games which can be treated as an extension of the classical cooperative games with transferable utilities. The coalitions have an exogenous probability of being realized. This probability…

Theoretical Economics · Economics 2023-08-08 Surajit Borkotokey , Sujata Gowala , Rajnish Kumar

We analyze a simple model of adaptive competition which captures essential features of a variety of adaptive competitive systems in the social and biological sciences. Each of N agents, at each time step of a game, joins one of two groups.…

adap-org · Physics 2007-05-23 Robert Savit , Radu Manuca , Rick Riolo

In recent papers, the theory of representations of finite groups has been proposed to analyzing the violation of Bell inequalities. In this paper, we apply this method to more complicated cases. For two partite system, Alice and Bob each…

Quantum Physics · Physics 2017-05-16 Yanmin Yang , Zhu-Jun Zheng

In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of…

Computational Complexity · Computer Science 2025-11-19 Nader H. Bshouty

We consider a 2-player permutation game inspired by the celebrated Erd\H{o}s-Szekeres Theorem. The game depends on two positive integer parameters $a$ and $b$ and we determine the winner and give a winning strategy when $a \geq b$ and $b…

Combinatorics · Mathematics 2026-03-10 Lara Pudwell