scholarly journals Weakly Stable Sets of NTU Game

2012 ◽  
Vol 02 (01) ◽  
pp. 91-93 ◽  
Author(s):  
Han Qiao ◽  
Hong-Wei Gao
Keyword(s):  
Stable Sets ◽  
Ntu Game ◽  
Weakly Stable

scholarly journals On Bargaining Sets of Convex NTU Games

2015 ◽  
Vol 17 (04) ◽  
pp. 1550008 ◽  
Author(s):  
Bezalel Peleg ◽  
Peter Sudhölter
Keyword(s):  
Bargaining Set ◽  
Ntu Games ◽  
The Core ◽  
Ntu Game ◽  
Bargaining Sets

We show that the Aumann–Davis–Maschler bargaining set and the Mas-Colell bargaining set of a non-leveled NTU game that is either ordinal convex or coalition merge convex coincides with the core of the game. Moreover, we show by means of an example that the foregoing statement may not be valid if the NTU game is marginal convex.

Covering Graphs by Colored Stable Sets

2004 ◽  
Vol 17 ◽  
pp. 145-149 ◽  
Author(s):  
Ulrich Faigle ◽  
Bernhard Fuchs ◽  
Britta Wienand
Keyword(s):  
Stable Sets

scholarly journals Coalition formation and history dependence

2020 ◽  
Vol 15 (1) ◽  
pp. 159-197 ◽  
Author(s):  
Bhaskar Dutta ◽  
Hannu Vartiainen
Keyword(s):  
Coalition Formation ◽  
Stable Set ◽  
Transferable Utility ◽  
Stable Sets ◽  
Solution Concepts ◽  
History Dependence ◽  
Von Neumann ◽  
Finite Games ◽  
A Chain ◽  
Indirect Dominance

Farsighted formulations of coalitional formation, for instance, by Harsanyi and Ray and Vohra, have typically been based on the von Neumann–Morgenstern stable set. These farsighted stable sets use a notion of indirect dominance in which an outcome can be dominated by a chain of coalitional “moves” in which each coalition that is involved in the sequence eventually stands to gain. Dutta and Vohra point out that these solution concepts do not require coalitions to make optimal moves. Hence, these solution concepts can yield unreasonable predictions. Dutta and Vohra restricted coalitions to hold common, history‐independent expectations that incorporate optimality regarding the continuation path. This paper extends the Dutta–Vohra analysis by allowing for history‐dependent expectations. The paper provides characterization results for two solution concepts that correspond to two versions of optimality. It demonstrates the power of history dependence by establishing nonemptyness results for all finite games as well as transferable utility partition function games. The paper also provides partial comparisons of the solution concepts to other solutions.

Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets

1993 ◽  
Vol 58 (1) ◽  
pp. 81-98
Author(s):  
Shaughan Lavine
Keyword(s):  
Pairwise Disjoint ◽  
Admissible Set ◽  
Effective Version ◽  
Reduction Property ◽  
Uniformization Property ◽  
Weakly Stable

AbstractLet be an admissible set. A sentence of the form is a sentence if φ ∈ (φ is ∨ Φ where Φ is an -r.e. set of sentences from ). A sentence of the form is an , sentence if φ is a sentence. A class of structures is, for example, a ∀1 class if it is the class of models of a ∀1() sentence. Thus ∀1() is a class of classes of structures, and so forth.Let i, be the structure 〈i, <〉, for i > 0. Let Γ be a class of classes of structures. We say that a sequence J1, …, Ji,…, i < ω, of classes of structures is a Γ sequence if Ji ∈ Γ, i < ω, and there is I ∈ Γ such that ∈ Ji, if and only if [],i, where [,] is the disjoint sum. A class Γ of classes of structures has the easy uniformization property if for every Γ sequence J1,…, Ji,…, i < ω, there is a Γ sequence J′t, …, J′i, …, i < ω, such that J′i ⊆ Ji, i < ω, ⋃J′i = ⋃Ji, and the J′i are pairwise disjoint. The easy uniformization property is an effective version of Kuratowski's generalized reduction property that is closely related to Moschovakis's (topological) easy uniformization property.We show over countable structures that ∀1() and ∃2() have the easy uniformization property if is a countable admissible set with an infinite member, that and have the easy uniformization property if α is countable, admissible, and not weakly stable, and that and have the easy uniformization properly. The results proved are more general. The result for answers a question of Vaught(1980).

Low-Reynolds-number flow around an oscillating circular cylinder at low Keulegan–Carpenter numbers

1998 ◽  
Vol 360 ◽  
pp. 249-271 ◽  
Author(s):  
H. DÜTSCH ◽  
F. DURST ◽  
S. BECKER ◽  
H. LIENHART
Keyword(s):  
Reynolds Number ◽  
Circular Cylinder ◽  
Time Step ◽  
Time Resolved ◽  
Reynolds Number Flow ◽  
Line Force ◽  
Number Flow ◽  
Weakly Stable ◽  
Fluid Behaviour ◽  
Good Agreement

Time-averaged LDA measurements and time-resolved numerical flow predictions were performed to investigate the laminar flow induced by the harmonic in-line oscillation of a circular cylinder in water at rest. The key parameters, Reynolds number Re and Keulegan–Carpenter number KC, were varied to study three parameter combinations in detail. Good agreement was observed for Re=100 and KC=5 between measurements and predictions comparing phase-averaged velocity vectors. For Re=200 and KC=10 weakly stable and non-periodic flow patterns occurred, which made repeatable time-averaged measurements impossible. Nevertheless, the experimentally visualized vortex dynamics was reproduced by the two-dimensional computations. For the third combination, Re=210 and KC=6, which refers to a totally different flow regime, the computations again resulted in the correct fluid behaviour. Applying the widely used model of Morison et al. (1950) to the computed in-line force history, the drag and the added-mass coefficients were calculated and compared for different grid levels and time steps. Using these to reproduce the force functions revealed deviations from those originally computed as already noted in previous studies. They were found to be much higher than the deviations for the coarsest computational grid or the largest time step. The comparison of several in-line force coefficients with results obtained experimentally by Kühtz (1996) for β=35 confirmed that force predictions could also be reliably obtained by the computations.

6. On the Way to Perfection: Primal Operations for Stable Sets in Graphs

2004 ◽  
pp. 51-76
Author(s):  
Claudio Gentile ◽  
Utz-Uwe Haus ◽  
Matthias Köppe ◽  
Giovanni Rinaldi ◽  
Robert Weismantel
Keyword(s):  
Stable Sets ◽  
The Way
Sign in / Sign up

Export Citation Format

Share Document