7 papers · 1 filter
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…
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…
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…