Related papers: The Doors
We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…
The research area of algorithms with predictions has seen recent success showing how to incorporate machine learning into algorithm design to improve performance when the predictions are correct, while retaining worst-case guarantees when…
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained during execution of one task has value for the execution of…
I study optimal disclosure policies in sequential contests. A contest designer chooses at which periods to publicly disclose the efforts of previous contestants. I provide results for a wide range of possible objectives for the contest…
Coordination is an important aspect of innovative contexts, where: the more innovative a course of action, the more uncertain its outcome. To study the interplay of coordination and informational ``complexity'', I embed a beauty-contest…
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…
Fair division with unequal shares is an intensively studied recourse allocation problem. For $ i\in [n] $, let $ \mu_i $ be an atomless probability measure on the measurable space $(C,\mathcal{S}) $ and let $ t_i $ be positive numbers…
The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the…
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…
In late May of 2014 I received an email from a colleague introducing to me a non-transitive game developed by Walter Penney. This paper explores this probability game from the perspective of a coin tossing game, and further discusses some…
In a classic model analysed by Weitzman an agent is presented with boxes containing prizes. She may open boxes in any order, discover prizes within, and optimally stop. She wishes to maximize the expected value of the greatest prize found,…
It is generally believed that in a situation where individual and collective interests are in conflict, the availability of optional participation is a key mechanism to maintain cooperation. Surprisingly, this effect is sensitive to the use…
Demonstrating quantum advantage in machine learning tasks requires navigating a complex landscape of proposed models and algorithms. To bring clarity to this search, we introduce a framework that connects the structure of parametrized…
In many social dilemmas, individuals tend to generate a situation with low payoffs instead of a system optimum ("tragedy of the commons"). Is the routing of traffic a similar problem? In order to address this question, we present…
Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…
We present tournament results and several powerful strategies for the Iterated Prisoner's Dilemma created using reinforcement learning techniques (evolutionary and particle swarm algorithms). These strategies are trained to perform well…
The most important factors which contribute to the efficiency of game-theoretical algorithms are time and game complexity. In this study, we have offered an elegant method to deal with high complexity of game theoretic multi-objective…
The problem of dividing resources fairly occurs in many practical situations and is therefore an important topic of study in economics. In this paper, we investigate envy-free divisions in the setting where there are multiple players in…
We use the Minority Game and some of its variants to show how efficiency depends on learning in models of agents competing for limited resources. Exact results from statistical physics give a clear understanding of the phenomenology, and…
In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocation models and constraints, and we present new geometric…