SearcharxivSearch

arXiv subjects

Sebastian E. Ferrando

Publications and source records attributed to Sebastian E. Ferrando.

6 recordsLinked to original sources

Sharp Causal Bounds for Dynamic Treatment Regimes

We study dynamic treatment regimes under contemporaneous confounding: at each stage, an unmeasured factor may affect both treatment and the next observed state, but has no further direct effect on later stages. From the observational distribution, the causal graph, and specified structural restrictions on possible next states, we construct at each state--treatment pair the set of transition probabilities compatible with this information. These local sets require no sensitivity parameter and can be combined by backward induction to obtain lower and upper bounds on the expected outcome under any given treatment regime. Our main result shows that these bounds are sharp: their endpoints are exactly the smallest and largest expected outcomes generated by causal models compatible with the same observational distribution, causal graph, and structural restrictions. The same backward-induction method gives a maximin rule for choosing treatments by maximizing the worst-case expected outcome. Thus, for this class of models with contemporaneous confounding, the framework generalizes the classical g-formula of \citet{Robins1986} for evaluating treatment regimes and the Q-learning framework of \citet{Murphy2003} for selecting them. When the local transition probabilities are identified, the two recursions reduce to these classical methods.

math.ST

Baseball, An Extensive-Form Game-Theoretic Duel

We formulate a baseball plate appearance as a finite two-person, zero-sum, extensive-form game with chance moves and imperfect information. Successive pitch cycles are connected through the evolving count, while the Batter chooses an action without observing the Pitcher's current pitch selection. Terminal outcomes are valued through a run-expectancy utility that incorporates both runs scored during the plate appearance and the continuation value of the half-inning. We implement the sequence-form representation of the game, whose linear-programming formulation grows linearly with the game tree and permits exact minimax equilibrium computations for trees far beyond the practical range of the normal form. Nature's transition probabilities are estimated from MLB Statcast data. We also establish two complementary dynamic-programming interpretations. For general finite two-person zero-sum games with perfect recall, we show that the dual variables of the sequence-form best-response programs decompose into reach weights and conditional continuation values. Under the additional state-Markov assumptions of the baseball model, we prove that the full minimax equilibrium can be computed by backward induction over the twelve non-terminal counts. The resulting computations produce equilibrium strategies, continuation values, and conditional and reach-weighted measures of the strategic cost of non-optimal actions.

math.OC

Optional Stopping for Superhedging Supermartingales

Superhedging supermartingales, introduced by the authors in previous work, are non-probabilistic processes defined via subadditive outer integrals that carry a purely financial interpretation in terms of superhedging cost. Building on the Leinert-K\"onig theory of non-lattice integration, the present paper establishes several results that are classical in probability theory but whose non-probabilistic proofs require fundamentally new arguments: (i) a tower inequality for the conditional outer integral \overline{\sigma}_j applied at stopping times, reducing to equality when the integrand is conditionally integrable; (ii) three versions of Doob's optional stopping theorem, organised by the class of supermartingale and the range of the stopping times; and (iii) Dubins' upcrossing inequality in both finite- and infinite-time horizons. A key structural result, property (K)-a.e., identifies conditions under which the two superhedging operators \overline{\sigma}_j and \overline{I}_j coincide on non-negative functions, extending the scope of all preceding results to the positive operator \overline{I}_j. None of the proofs invoke classical measure-theoretic tools; in particular, (classical) integrability and measurability are not assumed. The analogues of classical stochastic results acquire a purely financial interpretation and, in this way, gain depth and generality by providing a context that is independent of any a priori probabilistic structure.

math.PR

Agent-Based Models for Two Stocks with Superhedging

An agent-based modelling methodology for the joint price evolution of two stocks is put forward. The method models future multidimensional price trajectories reflecting how a class of agents rebalance their portfolios in an operational way by reacting to how stocks' charts unfold. Prices are expressed in units of a third stock that acts as numeraire. The methodology is robust, in particular, it does not depend on any prior probability or analytical assumptions and it is based on constructing scenarios/trajectories. A main ingredient is a superhedging interpretation that provides relative superhedging prices between the two modelled stocks. The operational nature of the methodology gives objective conditions for the validity of the model and so implies realistic risk-rewards profiles for the agent's operations. Superhedging computations are performed with a dynamic programming algorithm deployed on a graph data structure. Null subsets of the trajectory space are directly related to arbitrage opportunities (i.e. there is no need for probabilistic considerations) that may emerge during the trajectory set construction. It follows that the superhedging algorithm handles null sets in a rigorous and intuitive way. Superhedging and underhedging bounds are kept relevant to the investor by means of a worst case pruning method and, as an alternative, a theory supported pruning that relies on a new notion of small arbitrage.

q-fin.MF

Conditional Non-Lattice Integration, Pricing and Superhedging

Closely motivated by financial considerations, we develop an integration theory which is not classical i.e. it is not necessarily associated to a measure. The base space, denoted by $\mathcal{S}$ and called a trajectory space, substitutes the set $\Omega$ in probability theory and provides a fundamental structure via conditional subsets $\mathcal{S}_{(S,j)}$ that allows the definition of conditional integrals. The setting is a natural by-product of no arbitrage assumptions that are used to model financial markets and games of chance (in a discrete infinite time framework). The constructed conditional integrals can be interpreted as required investments, at the conditioning node, for hedging an integrable function, the latter characterized a.e. and in the limit as we increase the number of portfolios used. The integral is not classical due to the fact that the original vector space of portfolio payoffs is not a vector lattice. In contrast to a classical stochastic setting, where price processes are associated to conditional expectations (with respect to risk neutral measures), we uncover a theory where prices are naturally given by conditional non-lattice integrals. One could then study analogues of classical probabilistic notions in such non-classical setting, the paper stops after defining trajectorial martingales the study of which is deferred to future work.

math.PR

Discrete, Non Probabilistic Market Models. Arbitrage and Pricing Intervals

The paper develops general, discrete, non-probabilistic market models and minmax price bounds leading to price intervals for European options. The approach provides the trajectory based analogue of martingale-like properties as well as a generalization that allows a limited notion of arbitrage in the market while still providing coherent option prices. Several properties of the price bounds are obtained, in particular a connection with risk neutral pricing is established for trajectory markets associated to a continuous-time martingale model.

q-fin.MF