This paper is mainly to discuss cooperative games on convex geometries with a coalition structure, which can be seen as an extension of cooperative games with a coalition structure. For this kind of games, the cooperation among unions and within each union will be the convex sets, i.e., the feasible subsets of the coalition structure and that of each union belong to a convex geometry, respectiv...

This paper is concerned with the question of defining the bargaining set, a cooperative game solution, when cooperation takes place in a dynamic setting. The focus is on dynamic cooperative games in which the players face (finite or infinite) sequences of exogenously specified TU-games and receive sequences of imputations against those static cooperative games in each time period. Two alternati...

Braess' paradox is a classical result in the theory of congestion games. It motivates theoretically why adding resource (e.g., an arc) to network may sometimes worsen, rather than improve, overall performance. Differently from previous literature, which studies non-cooperative game-theoretic setting, this work, framework proposed investigate its occurrence by exploiting cooperative games with t...

This paper considers advertising, collection and pricing decisions simultaneously for a closed-loop supplychain(CLSC) with one manufacturer(he) and two retailers(she). A multiplicatively separable new demand function is proposed which influenced by pricing and advertising. In this paper, three well-known scenarios in the game theory including the Nash, Stackelberg and Cooperative games are expl...

English vocabulary, especially at the elementary stage of language learning process, is easily forgotten. Language games seem to be a good strategy for learning a foreign language. This study aimed to find a way to help elementary EFL learners fix the new English numbers in their minds. First, the general test of English numbers as a pretest was administered to 60 participants. They were requir...

OF THE THESIS Coalitional Games in Cooperative Networks

A model of taxation for cooperative n-person games is introduced where proper coalitions are taxed proportionally to their value. Games with non-empty core under taxation at rate e are a-balanced. Sharp bounds on e in matching games on (not necessarily bipartite) graphs are established. Upper and lower bounds on the smallest e in bin packing games are derived and euclidean random TSP games are ...

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that hav...

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a coalition of vertices is the weight of the maximum size matching in the subgraph induced by the coalition. The Shapley value is one of the most important solution c...

The goal of this report is two-fold: Firstly, we present a short introduction on congestion games, a class of non-cooperative games that have received considerable attention by the research community during the last years. We discuss their properties and present their two most prominent extensions, namely weighted congestion games and player-specific congestion games. Secondly, we discuss appli...