English
Related papers

Related papers: Knights, spies, games and ballot sequences

200 papers

We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with their preferences), but where it is uncertain either which…

Computer Science and Game Theory · Computer Science 2016-03-27 Krzysztof Wojtas , Krzysztof Magiera , Tomasz Miąsko , Piotr Faliszewski

The Warden's Game is a 2-player game, played with a row of coins. One player (the prisoner) wants to get all coins to show tails; the other player (the warden) wants to delay that as long as possible. At each turn, one player transfers the…

Combinatorics · Mathematics 2018-07-26 Joseph DiMuro

In the multidimensional stable roommate problem, agents have to be allocated to rooms and have preferences over sets of potential roommates. We study the complexity of finding good allocations of agents to rooms under the assumption that…

Computer Science and Game Theory · Computer Science 2020-05-01 Niclas Boehmer , Edith Elkind

Given a set of n balls each colored with a color, a ball is said to be majority, k-majority, plurality if its color class has size larger than half of the number of balls, has size at least k, has size larger than any other color class;…

Combinatorics · Mathematics 2012-03-08 Dániel Gerbner , Gyula O. H. Katona , Dömötör Pálvölgyi , Balázs Patkós

This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…

Information Theory · Computer Science 2020-05-28 Alex S. Leong , Daniel E. Quevedo , Subhrakanti Dey

In an adversarial environment, a hostile player performing a task may behave like a non-hostile one in order not to reveal its identity to an opponent. To model such a scenario, we define identity concealment games: zero-sum stochastic…

Computer Science and Game Theory · Computer Science 2024-03-05 Mustafa O. Karabag , Melkior Ornik , Ufuk Topcu

We consider the cheating strategies for the popular matchings problem. The popular matchings problem can be defined as follows: Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and the edges…

Data Structures and Algorithms · Computer Science 2013-01-08 Meghana Nasre

A new evolutionary solution to Prisoner Dilemma situations is proposed in this paper. A specific genetic code may have different phenotypes, meaning different strategies for different individuals carrying that gene. This means that, under…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Andre C. R. Martins

In this article, we look at a hat-guessing game, in which each player must guess the color of their own hat while only seeing the hats of the other players. We focus on the case of two hat colors and a countably infinite number of players.…

Probability · Mathematics 2025-10-28 Nathaniel Eldredge

This paper presents iNNK, a multiplayer drawing game where human players team up against an NN. The players need to successfully communicate a secret code word to each other through drawings, without being deciphered by the NN. With this…

Dialogue games are two-player logic games between a Proponent who puts forward a logical formula A as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which…

Logic · Mathematics 2014-01-07 Jesse Alama , Sara Uckelman

Dota 2 is a popular, multiplayer online video game. Like many online games, players are mostly anonymous, being tied only to online accounts which can be readily obtained, sold and shared between multiple people. This makes it difficult to…

Artificial Intelligence · Computer Science 2020-08-31 Sizhe Yuen , John D. Thomson , Oliver Don

In the `Covering' pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim…

Combinatorics · Mathematics 2025-04-22 Benjamin Gillott

Deception is a fundamental issue across a diverse array of settings, from cybersecurity, where decoys (e.g., honeypots) are an important tool, to politics that can feature politically motivated "leaks" and fake news about candidates.Typical…

Artificial Intelligence · Computer Science 2019-11-15 Andrew Estornell , Sanmay Das , Yevgeniy Vorobeychik

Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and…

Computational Complexity · Computer Science 2023-07-14 Roey Magen , Moni Naor

Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which…

History and Overview · Mathematics 2023-05-02 Richard D. Gill

The Keynesian Beauty Contest is a classical game in which strategic agents seek to both accurately guess the true state of the world as well as the average action of all agents. We study an augmentation of this game where agents are…

Computer Science and Game Theory · Computer Science 2019-05-03 Hadi Elzayn , Zachary Schutzman

In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the…

Combinatorics · Mathematics 2026-03-03 Rüdiger Jehn

This paper studies the relations between agent performances and their intellective abilities in mix-games in which there are two groups of agents: one group plays a minority game, and the other plays a majority game. These two groups have…

Physics and Society · Physics 2007-05-23 Chengling Gou

Consider a bin containing $n$ balls colored with two colors. In a $k$-query, $k$ balls are selected by a questioner and the oracle's reply is related (depending on the computation model being considered) to the distribution of colors of the…

Data Structures and Algorithms · Computer Science 2011-05-10 Gianluca De Marco , Evangelos Kranakis , Gabor Wiener