5 resultados para Semilinear sets
em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco
Resumo:
In this paper we present a solution concept for abstract systems called the admissible hierarchic set. The solution we propose is a refinement of the hierarchic solution, a generalization of the von Neumann and Morgenstern solution. For finite abstract systems we show that the admissible hierarchic sets and the von Neumann and Morgenstern stable sets are the only outcomes of a coalition formation procedure (Wilson, 1972 and Roth, 1984). For coalitional games we prove that the core is either a vN&M stable set or an admissible hierarchic set.
Resumo:
We study international environmental negotiations when agreements between countries can not be binding. A problem with this kind of negotiations is that countries have incentives for free-riding from such agreements. We develope a notion of equilibrium based on the assumption that countries can create and dissolve agreements in their seeking of a larger welfare. This approach leads to a larger degree of cooperation compared to models based on the internal-external stability approach.
Resumo:
We analyze the von Neumann and Morgenstern stable sets for the mixed extension of 2 2 games when only single profitable deviations are allowed. We show that the games without a strict Nash equilibrium have a unique vN&M stable set and otherwise they have infinite sets.
Resumo:
[EN] Teaching vocabulary in semantically related sets is common practice among EFL teachers. The present study tests the effectiveness of this method by comparing it to the alternative technique: presenting vocabulary in an unrelated way. In the study two intact classes of Spanish learners of English in high-school were presented with a set of unrelated and related words and were then asked to complete a post-test to measure the impact of both techniques on learning. The results indicate that, while both techniques successfully help the learners to acquire new words, presenting words in unrelated sets seems to be more effective.
Resumo:
This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical