Related papers: Greedy Galois Games
We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…
State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and bound.
In a vintage paper concerning Parsimonious games, a subset of constant sum homogeneous weighted majority games, Isbell introduced a twin relationship based on transposition properties of the incidence matrices upon minimal winning…
Behavioral experiments on the Ultimatum Game have shown that we human beings have remarkable preference in fair play, contradicting the predictions by the game theory. Most of the existing models seeking for explanations, however, strictly…
In [25], T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps, with a focus on the $\mathbf n$-$t$-quasi-greedy property that is based on them. Building upon this foundation, our…
Over a century ago, Oliver Wendell Holmes invited scholars to look at the law through the lens of probability theory: "The prophecies of what the courts will do in fact, and nothing more pretentious, are what I mean by the law." Yet few…
We study mechanisms that use greedy allocation rules and pay-your-bid pricing to allocate resources subject to a matroid constraint. We show that all such mechanisms obtain a constant fraction of the optimal welfare at any equilibrium of…
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…
We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…
In this paper we consider the generalized Walsh system and a problem $L^1- convergence$ of greedy algorithm of functions after changing the values on small set.
We consider a two-player game in which the first player (the Guesser) tries to guess, edge-by-edge, the path that second player (the Chooser) takes through a directed graph. At each step, the Guesser makes a wager as to the correctness of…
We study a modified prisoner's dilemma game taking place on two-dimensional disordered square lattices. The players are pure strategists and can either cooperate or defect with their immediate neighbors. In the generations each player…
We introduce a "high probability" framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high…
Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any…
We consider a Bradley-Terry model in random environment where each player faces each other once. More precisely the strengths of the players are assumed to be random and we study the influence of their distributions on the asymptotic number…
We study the emergence of altruistic behaviour in collective games. In particular, we take into account Toral's version of collective Parrondo's paradoxical games, in which the redistribution of capital between agents, who can play…
For the past 25 years, one of the most studied algorithms in the field of Nonlinear Approximation Theory has been the Thresholding Greedy Algorithm. In this paper, we propose new summability methods for this algorithm, generating two new…
We consider {\em bidding games}, a class of two-player zero-sum {\em graph games}. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit…
Penney's Ante exhibits non-transitivity when two target strings race to appear in a shared stream of coin tosses. We study instead independent string races, where each player observes their own independent and identically distributed…
We study a modification of the so-called Parrondo's paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own…