activity
20032026
most citedTwo-player nonZero-sum stopping games in discrete time

54 citations · 110 across the 46 of their papers we have counts for

collaborators
Showing math.OCShow all

24 papers · 1 filter

math.OC2026

Value of Information in Dynamic Decision Making

Dimitry Shaiderman, Eilon Solan

We study the value of information in predicting the evolving state of a finite Markov chain. At each stage, a decision maker chooses a state and observes only whether the current s…

math.OC2025

The Design of Optimal Dependency and Rewards

Eilon Solan, Avraham Tabbach, Chang Zhao

We analyze a two-period principal-agent model in which the principal faces a budget constraint, and the agent's private costs of performing tasks across the two periods may be corr…

math.OC2025

Undiscounted Equilibrium in Positive Recursive Absorbing Games with Non-Rectangular Absorption Structure

Eilon Solan, Nicolas Vieille

An absorbing game is a stochastic game with a single nonabsorbing state. Such a game is called recursive if all players receive a payoff of 0 in the nonabsorbing state, and positiv…

math.OC2025

The Maxmin Value of Repeated Games with Incomplete Information on One Side and Tail-Measurable Payoffs

Gil Bar Castellon Koltun, Ehud Lehrer, Eilon Solan

We study two-player zero-sum repeated games with incomplete information on one side, where the payoff function is tail measurable (and not necessarily the long-run average payoff).…

math.OC2025

Games with infinite past

Galit Ashkenazi-Golan, János Flesch, Eilon Solan

We study multi-player games with perfect information and general payoff function, where the set of stages is the set of non-positive integers . We define two re…

math.OC2024

Bayesian Dissuasion with Bandit Exploration

Massimo DAntoni, Ehud Lehrer, Avraham Tabbach +1

We investigate a two-period Bayesian persuasion game, where the receiver faces a decision, akin to a one-armed bandit problem: to undertake an action, gaining noisy information and…