English
Related papers

Related papers: A choiceless box game paradox

200 papers

We consider discrete time partially observable zero-sum stochastic game with average payoff criterion. We study the game using an equivalent completely observable game. We show that the game has a value and also we come up with a pair of…

Optimization and Control · Mathematics 2014-09-16 Subhamay Saha

Ball sort puzzle is a popular logic puzzle consisting of several bins containing balls of multiple colors. Each bin works like a stack; a ball has to follow the last-in first-out order. The player has to sort the balls by color such that…

Cryptography and Security · Computer Science 2023-12-04 Suthee Ruangwises

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

Computer Science and Game Theory · Computer Science 2024-10-22 Jamie Tucker-Foltz , Richard Zeckhauser

This paper investigates mixed strategies in dynamic games with perfect information. We present an example to show that a player may obtain higher payoff by playing mixed strategy. By contrast, the main result of the paper shows that every…

Optimization and Control · Mathematics 2020-01-01 Enxian Chen , Wei He , Yeneng Sun , Hanping Xu

The article introduces a notion of a stochastic game with failure states and proposes two logical systems with modality "coalition has a strategy to transition to a non-failure state with a given probability while achieving a given goal."…

Artificial Intelligence · Computer Science 2019-10-11 Pavel Naumov , Kevin Ros

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

Statistical Mechanics · Physics 2007-05-23 F. K. Chow , H. F. Chau

In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under…

Logic in Computer Science · Computer Science 2013-03-05 Rayna Dimitrova , Bernd Finkbeiner

We consider how an agent should update her uncertainty when it is represented by a set $\P$ of probability distributions and the agent observes that a random variable $X$ takes on value $x$, given that the agent makes decisions using the…

Artificial Intelligence · Computer Science 2007-11-27 Peter D. Grunwald , Joseph Y. Halpern

People reason heuristically in situations resembling inferential puzzles such as Bertrand's box paradox and the Monty Hall problem. The practical significance of that fact for economic decision making is uncertain because a departure from…

Econometrics · Economics 2018-02-27 Fatemeh Borhani , Edward J. Green

The Parrondo effect describes the seemingly paradoxical situation in which two losing games can, when combined, become winning [Phys. Rev. Lett. 85, 24 (2000)]. Here we generalize this analysis to the case where both games are…

Condensed Matter · Physics 2009-11-07 Roland J. Kay , Neil F. Johnson

We consider how an agent should update her uncertainty when it is represented by a set P of probability distributions and the agent observes that a random variable X takes on value x, given that the agent makes decisions using the minimax…

Artificial Intelligence · Computer Science 2014-07-29 Peter D. Grunwald , Joseph Y. Halpern

In this paper we model a game such that all strategies are non-revealing, with imperfect recall and incomplete information. We also introduce a modified sliding-block code as a linear transformation which generates common knowledge of how…

Computer Science and Game Theory · Computer Science 2024-09-24 Ian Malloy

Conventional noncooperative game theory hypothesizes that the joint strategy of a set of players in a game must satisfy an "equilibrium concept". All other joint strategies are considered impossible; the only issue is what equilibrium…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 David H. Wolpert

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Computational Complexity · Computer Science 2009-09-25 Erik D. Demaine , Robert A. Hearn

We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.

chao-dyn · Physics 2008-02-03 Karl Svozil

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

Computer Science and Game Theory · Computer Science 2017-04-04 Valerio Capraro , Marco Scarsini

We initiate the study of the phantom version of Maker-Breaker positional games. In a phantom game, the moves of one of the players are hidden from the other player, who still has the complete information. We look at the biased $(a:b)$…

Combinatorics · Mathematics 2025-07-31 Dennis Clemens , Fabian Hamann , Mirjana Mikalački , Yannick Mogge , Miloš Stojaković

In this paper we study continuous-time two-player zero-sum optimal switching games on a finite horizon. Using the theory of doubly reflected BSDEs with interconnected barriers, we show that this game has a value and an equilibrium in the…

Optimization and Control · Mathematics 2018-06-04 Said Hamadène , Randall Martyr , John Moriarty

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

We study lower bounds on the query complexity of determining correlated equilibrium. In particular, we consider a query model in which an n-player game is specified via a black box that returns players' utilities at pure action profiles. In…

Computer Science and Game Theory · Computer Science 2013-07-15 Yakov Babichenko , Siddharth Barman
‹ Prev 1 4 5 6 7 8 10 Next ›