A transportation problem with competition

The classic transportation problem can be generalized with many carriers and one owner. From the formulation the competition in sense of game theory naturally appears. Here we present and solve this problem using a generalized n-person game. Besides the same composition properties about solutions and regarding zones, related results are considered. Finally, the problem in which there is a modification of the set of destinations assigned to the carriers is also studied.     

Simple stability of general n- person games

Herein are introduced noncooperative points of n-person games defined on compact and convex sets in a Euclidean space and continuous payoff functions, which are natural extensions of the respective concepts of maximin, minimax strategies and saddle points of two-person games. The conc:ept of equilibrium point appears as a special of one of those. As a particular case, we examine such points for the mixed extension of finite n-person games; finally, a related topic is illustrated. These results represent the first installment of a collection which will be continued in subsequent publications.