10 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…
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…
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…
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…
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…
Global Independence of Irrelevant Alternatives, State-Salient Decision Rules and the Strict Condorcet Choice Function
Somdeb Lahiri
We present a simple proof of a well-known axiomatic characterization of state-salient decision rules, using Weak Dominance Criterion and Global Independence of Irrelevant Alternati…
Continuity in Parametric Linear Programming
Somdeb Lahiri
In this paper we assemble some results about the upper-semicontinuity and lower-semicontinuity of the feasible correspondence and the solution correspondence of linear programming…
Loss Aversion and State-Dependent Linear Utility Functions for Monetary Returns
Somdeb Lahiri
We present a theory of expected utility with state-dependent linear utility functions for monetary returns, that incorporates the possibility of loss-aversion. Our results relate t…
Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
Somdeb Lahiri
We provide an exact algorithm to solve the log-linear continuous (fractional) knapsack problem. The algorithm is based on two lemmas that follow from the application of weak dualit…
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…