Serap Ergün

Cooperative grey games and the grey Shapley value

This contribution is located in the common area of operational research and economics, with a close relation and joint future potential with optimization: game theory. We focus on collaborative game theory under uncertainty. This study is on a new class of cooperative games where the set of players is finite and the coalition values are interval grey numbers. An interesting solution concept, the grey Shapley value, is introduced and characterized with the properties of additivity, efficiency, symmetry and dummy player, which are straightforward generalizations of the corresponding properties in the classical cooperative game theory. The paper ends with a conclusion and an outlook to future studies.

A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects

Recently, crypto-cloud computing has become an interesting research area with many technical, security, commercial and financial aspects, goals and consequences. The original intention of the cloud is to link computing stations (services) for collaboration. Sharing and coordination of computational resources is important because of the activities between service providers and service requesters. Considering the cooperative functionality of crypto-cloud computing, the use of game theory in that area has became very beneficial. In the sequel, we mathematically associate that area with game theory, i.e., the bargaining and compromising of interests of various “players”, by using a game-theoretical approach which arises from networks, servers, operating systems, storage devices, etc. Further, we propose a novel efficient encryption system by using XTR (effective and compact subgroup trace representation) which has the property of semantic security. Those interactions has been constructed in the direction of how cryptographic tools can be used to address a natural optimization problem in the fields of game theory and financial economics. It is believed that game theory and its optimization is going to provide a suitable framework for the design of a crypto-cloud computing system that will be perceived as a strong technique and satisfy the needs of many participants and users of the cloud. The paper ends with a conclusion and an outlook to future studies.

A Study on the Using of Game Theory in Sustainable Construction

In recent years, population growth, consumption of natural resources as a result of industrialization and urbanization, environmental issues have increased rapidly and this increase has reached dangerous proportions. Therefore, Environmental concept has influenced the structure of the planning discipline, ecological approach to planning and sustainability has gained importance. In this area, using different methods have been made in the quest to produce fast and effective solutions. Game theory approach, which can be given as an example of such methods, is seen planning and structure design in the content of sustainability. In this paper, studies on the sustainability and game theory concepts in the literature have been investigated and evaluated, as a whole.

Cooperative Grey Games: Grey Solutions and an Optimization Algorithm

In this paper, some set-valued solutions using grey payoffs, namely, the grey core, the grey dominance core, and the grey stable sets of cooperative grey games are introduced and studied. The findings of the study demonstrated the relations between the grey core, the grey dominance core, and stable sets of grey cooperative games. Moreover, we present a linear programming (LP) problem for the grey core. We also suggest a corresponding optimization-based algorithm that demonstrates the grey core element of a cooperative grey game. Finally, we introduce an application of how cooperative grey game theory can be used to model users’ behaviors in various multimedia social networks. The paper ends with a conclusion and an outlook for future investigations.

A New Game-Theoretical Approach in Network Routing: Algorithms and Their Performance Analysis in OMNeT++

In this paper, we generally study performance of some network routing algorithms. These are Kruskal’s, Prim’s and Sollin’s algorithms as tree algorithms that are used in minimum spanning trees problems. Further, we propose new algorithms that are modeled by game-theoretical approach. Mathematical models have been used to solve complex problems such as those in social sciences, economics, psychology, politics and telecommunication. In this context, game theory can be defined as a mathematical framework consisting of models and techniques analyzing the behavior of individuals concerned about their own benefits. Game theory deals with multi-person decision making, in which each decision maker tries to maximize own utility or minimize own cost and is applied to networking, in most cases to solve routing and resource allocation problems in a competitive environment. Modeling the network scenarios with the game-theoretical approach is one of the pioneering aims of the study. The algorithms for performance analysis are carried out OMNeT++, which is a network simulation program. Finally, the results are compared with each other and the literature.