We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.

This paper discusses the theoretical and practical aspects of new methods for solving DEA problems under real-life geometrical uncertainty and probability uncertainty of sample data. The proposed minimax approach to solve problems with geometrical uncertainty of sample data involves an...

This paper is concerned with inference about an unidentified linear function, L(g), where the function g satisfies the relation Y=g(X)+U; E(U |W)=0. In this relation, Y is the dependent variable, X is a possibly endogenous explanatory variable, W is an instrument for X and U is an unobserved...