English
Related papers

Related papers: The Social Will-Testing Game and its Solution

200 papers

We consider games in which players search for a hidden prize, and they have asymmetric information about the prize location. We study the social payoff in equilibria of these games. We present sufficient conditions for the existence of an…

Theoretical Economics · Economics 2022-04-19 Gilad Bavly , Yuval Heller , Amnon Schreiber

All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures, and fully characterize…

Computer Science and Game Theory · Computer Science 2017-02-15 Yoad Lewenberg , Omer Lev , Yoram Bachrach , Jeffrey S. Rosenschein

This paper analyzes a simple game with $n$ players. We fix a mean, $\mu$, in the interval $[0, 1]$ and let each player choose any random variable distributed on that interval with the given mean. The winner of the zero-sum game is the…

Probability · Mathematics 2018-04-24 Artem Hulko , Mark Whitmeyer

In this paper we study the complexity of strategic argumentation for dialogue games. A dialogue game is a 2-player game where the parties play arguments. We show how to model dialogue games in a skeptical, non-monotonic formalism, and we…

Logic in Computer Science · Computer Science 2013-12-17 Guido Governatori , Francesco Olivieri , Simone Scannapieco , Antonino Rotolo , Matteo Cristani

An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…

Computer Science and Game Theory · Computer Science 2013-08-01 Leslie Ann Goldberg , Paul W. Goldberg , Piotr Krysta , Carmine Ventre

The ability of a deterministic, plastic system to learn to imitate stochastic behavior is analyzed. Two neural networks -actually, two perceptrons- are put to play a zero-sum game one against the other. The competition, by acting as a kind…

Disordered Systems and Neural Networks · Physics 2009-10-31 I. Samengo , D. H. Zanette

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

We introduce a new virtual environment for simulating a card game known as "Big 2". This is a four-player game of imperfect information with a relatively complicated action space (being allowed to play 1,2,3,4 or 5 card combinations from an…

Machine Learning · Computer Science 2018-09-03 Henry Charlesworth

We consider collective decision making when the society consists of groups endowed with voting weights. Each group chooses an internal rule that specifies the allocation of its weight to the alternatives as a function of its members'…

Theoretical Economics · Economics 2024-02-20 Kazuya Kikuchi , Yukio Koriyama

In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to…

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

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

For any two-by-two game $\G$, we define a new two-player game $\G^Q$. The definition is motivated by a vision of players in game $\G$ communicating via quantum technology according to a certain standard protocol originally introduced by…

Optimization and Control · Mathematics 2011-10-07 Steven E. Landsburg

Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…

Logic in Computer Science · Computer Science 2014-05-01 Dietmar Berwanger , Anup Basil Mathew

The timing of strategic exit is one of the most important but difficult business decisions, especially under competition and uncertainty. Motivated by this problem, we examine a stochastic game of exit in which players are uncertain about…

Optimization and Control · Mathematics 2023-10-09 H. Dharma Kwon , Jan Palczewski

Matrix games constitute a fundamental problem of game theory and describe a situation of two players with completely conflicting interests. We show how methods from statistical mechanics can be used to investigate the statistical properties…

Disordered Systems and Neural Networks · Physics 2009-10-31 J. Berg , A. Engel

To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…

Computer Science and Game Theory · Computer Science 2026-05-20 Léonard Brice

A $p$-beauty contest is a wide class of games of guessing the most popular strategy among other players. In particular, guessing a fraction of a mean of numbers chosen by all players is a classic behavioral experiment designed to test…

General Economics · Economics 2025-10-23 Iuliia Alekseenko , Dmitry Dagaev , Sofia Paklina , Petr Parshakov

This work lies in the fusion of experimental economics and data mining. It continues author's previous work on mining behaviour rules of human subjects from experimental data, where game-theoretic predictions partially fail to work.…

Computer Science and Game Theory · Computer Science 2012-11-13 Rustam Tagiew

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

Computer Science and Game Theory · Computer Science 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations…

Computer Science and Game Theory · Computer Science 2021-06-23 Krzysztof R. Apt , Sunil Simon
‹ Prev 1 4 5 6 7 8 10 Next ›