Algebraic duality theorems for infinite LP problems

In this paper we consider a primal-dual infinite linear programming problem-pair, i.e. LPs on infinite dimensional spaces with infinitely many constraints. We present two duality theorems for the problem-pair: a weak and a strong duality theorem. We do not assume any topology on the vector spaces, therefore our results are algebraic duality theorems. As an application, we consider transferable utility cooperative games with arbitrarily many players.

Pairwise comparison matrices: an empirical research

Our research focused on testing various characteristics of pairwise comparison (PC) matrices in controlled experiments. About 270 students have been involved in the test exercises and the final pool contained 450 matrices. Our team conducted experiments with matrices of different size obtained from different types of MADM problems. The matrix elements have been generated by different questioning orders, too. The cases have been divided into 18 subgroups according to the key factors to be analyzed. The testing environment made it possible to analyze the dynamics of inconsistency as the number of elements increased in a given case. Various types of inconsistency indices have been applied. The consequent behavior of the decision maker has also been analyzed in case of incomplete matrices using indicators to measure the deviation from the final ranking of alternatives and from the final score vector.

Generalized type spaces

Ordinary type spaces (Heifetz and Samet, 1998) are essential ingredients of incomplete information games. With ordinary type spaces one can grab the notions of beliefs, belief hierarchies and common prior etc. However, ordinary type spaces cannot handle the notions of finite belief hierarchy and unawareness among others. In this paper we consider a generalization of ordinary type spaces, and introduce the so called generalized type spaces which can grab all notions ordinary type spaces can and more, finite belief hierarchies and unawareness among others. We also demonstrate that the universal generalized type space exists.

Versenyképesség haloptikával – Helyi gazdaságfejlesztési problémák fejlődő városokban = Competitiveness at short range - Local problems of economic development in medium-sized towns

The aim of our research in the first half of 2011 was to find out what were the administrative, regulative and other problems that were specific obstacles to local economic development and what best practices can be found in local economies. During our research we carried out interviews with leaders and local professionals in five medium size towns of Hungary. We stated that the most obstructive factors were the imperfection of vocational training, the excessively bureaucratic administrative proceedings (supplying of data, acquisition of authority permits, the attitude of the authorities, etc.) and the system of application and finding sources of funds. We think that the most innovative solutions are the good examples of the institutionalized co-operation between local governments and local businesses. We've come to the conclusion that there is a need for reducing administrative burdens for the sake of local economic development.