9 papers
Two-Person Additively-Separable Sum Games
Somdeb Lahiri
We consider a sub-class of bi-matrix games which we refer to as two-person (hereafter referred to as two-player) additively-separable sum (TPASS) games, where the sum of the pay-of…
Lexicographic Preferences over Random Availability Functions
Somdeb Lahiri
We provide an axiomatic characterization of lexicographic preferences over the set of all random availability functions using two assumptions. The first assumption is strong monoto…
A Deterministic and Linear Model of Dynamic Optimization
Somdeb Lahiri
We introduce a model of infinite horizon linear dynamic optimization and obtain results concerning existence of solution and satisfaction of the competitive condition and transvers…
Numerical Representation of Preferences over Random Availability Functions
Somdeb Lahiri
We interpret a fuzzy set as a random availability function and provide sufficient conditions under which a preference relation over the set of all random availability functions can…
The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
Somdeb Lahiri
Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we…
Linear models of dynamic optimization with linear constraints
Somdeb Lahiri
We introduce a model of infinite horizon linear dynamic optimization with linear constraints and obtain results concerning feasibility of trajectories and optimal solutions necessa…