The Gale-Shapely algorithm for the Stable Marriage Problem is known to take \Theta(n^2) steps to find a stable marriage in the worst case, but only \Theta(n log n) steps in the average case (with n women and n men). In 1976, Knuth asked whether the worst-case running time can be improved in a...

We consider an infinite two-player stochastic zero-sum game with a Borel winning set, in which the opponent's actions are monitored via stochastic private signals. We introduce two conditions of the signalling structure: Stochastic Eventual Perfect Monitoring (SEPM) and Weak Stochastic Eventual...

The usual purpose of negotiations is to explore options and reach an agreement, if possible. We investigated a notable exception to this generalization, where a party negotiates without any intention of reaching an agreement. False negotiation occurs when a party gains more by stalling the...

Inspired by the existing work on correlated equilibria and regret-based dynamics in games, we carry out a first exploration of the links between the leading equilibrium concept for (exchange) economies, Walrasian equilibrium, and the dynamics, specifically regret-matching dynamics, of trading...

Consider a setting in which agents can each take one of two ordered actions and in which the incentive of any given agent to take the high action is positively reinforced by the number of other agents that take it. Furthermore, assume that we don't know any other details about the game being...

Assuming a `spectrum' or ordering on the players of a coalitional game, as in a political spectrum in a parliamentary situation, we consider a variation of the Shapley value in which coalitions may only be formed if they are connected with respect to the spectrum. This results in a naturally...

Every continuous-time stochastic game with finitely many states and actions has a uniform and limiting-average equilibrium payoff.

Aumann--Serrano (2008) and Foster--Hart (2009) suggest two new riskiness measures, each of which enables one to elicit a complete and objective ranking of gambles according to their riskiness. Hart (2011) shows that both measures can be obtained by looking at a large set of utility functions and...

The dominant computational approach to model operant learning and its underlying neural activity is model-free reinforcement learning (RL). However, there is accumulating behavioral and neuronal-related evidence that human (and animal) operant learning is far more multifaceted. Theoretical...

Maximizing the revenue from selling two goods (or items) is a notoriously difficult problem, in stark contrast to the single-good case. We show that simple "one-dimensional" mechanisms, such as selling the two goods separately, guarantee at least 73% of the optimal revenue when the valuations of...