Showing 1 - 10 of 5,928
The purpose of this paper is to formulate and study a game where there is a player who is involved for a long time interval and several small players who stay in the game for short time intervals. Examples of such games abound in practice. For example a Bank is a long-term player who stays in...
Persistent link: https://www.econbiz.de/10010854573
The present paper investigates the functioning of an Emission Trading System (ETS) and its impact on the diffusion of environmental-friendly technological innovation in the presence of firms’ strategic behaviours and sanctions to non-compliant firms. For this purpose, we study an evolutionary...
Persistent link: https://www.econbiz.de/10010904915
matchings, which are called Q-stable matchings. These matchings are core consistent and we offer an efficient algorithm for … computing one of them. The outcome of the algorithm belongs to an absorbing set. …
Persistent link: https://www.econbiz.de/10010941765
Qualitative coalitional games (QCG) are representations of coalitional games in which self interested agents, each with their own individual goals, group together in order to achieve a set of goals which satisfy all the agents within that group. In such a representation, it is the strategy of...
Persistent link: https://www.econbiz.de/10005385439
the results generated by traditional game theory. This paper aims to find to what extent these discrepancies between … theory and experiments can be explained by the effects of bounded rationality and learning dynamics. These are modeled by …
Persistent link: https://www.econbiz.de/10005345615
Suppose that the agents of a matching market contact each other randomly and form new pairs if is in their interest. Does such a process always converge to a stable matching if one exists? If so, how quickly? Are some stable matchings more likely to be obtained by this process than others? In...
Persistent link: https://www.econbiz.de/10009366300
we present an O(nm+n2 log n) algorithm that tests if the core of a matching game defined on a weighted graph with n … vertices and m edges is nonempty and that computes a core member if the core is nonempty. This algorithm improves previous work …
Persistent link: https://www.econbiz.de/10010551502
In social choice settings with linear preferences, random dictatorship is known to be the only social decision scheme satisfying strategyproofness and ex post efficiency. When also allowing indifferences, random serial dictatorship (RSD) is a well-known generalization of random dictatorship that...
Persistent link: https://www.econbiz.de/10010729460
In matching theory of contracts the substitutes condition plays an essential role to ensure the existence of stable …
Persistent link: https://www.econbiz.de/10010670819
paper we present a polynomially bounded algorithm of order p2 for calculating the nucleolus of neighbour games. …
Persistent link: https://www.econbiz.de/10005775427