We introduce a model of bargaining among groups, and characterize a family of solutions using a Consistency axiom and a few other invariance and monotonicity properties. For each solution in the family, there exists some constant α ≥ 0 such that the "bargaining power" of a group is proportional to cα, where c is the cardinality of the group. Subject classification: JEL C71, C78

Two different paradoxes of the fuzzy logic programming system of [29] are presented. The first paradox is due to two distinct (contradictory) truth values for every ground atom of FLP, one is syntactical, the other is semantical. The second paradox concerns the cardinality of the valid FLP formulas which is found to have contradictory values: both $\aleph_0$ the cardinality of the natural numbe...

In this paper, we discuss different models for human logic systems and describe a game with nature. Gödel‘s incompleteness theorem is taken into account to construct a model of logical networks based on axioms obtained by symmetry breaking. These classical logic networks are then coupled using rules that depend on whether two networks contain axioms or anti-axioms. The social lattice of axiom b...

We give an affirmative answer to Brendle’s and Hrušák’s question of whether the club principle together with h > א1 is consistent. We work with a class of axiom A forcings with countable conditions such that q ≥n p is determined by finitely many elements in the conditions p and q and that all strengthenings of a condition are subsets, and replace many names by actual sets. There are two types o...

Proof. Without loss of generality, we only need to prove for the case s= 1, as ρ satisfies Axioms A1-A5 if and only if 1 s ρ satisfies Axioms A1-A5 (with s= 1 in Axiom A3). The “only if” part. First, we show that (2) holds for any X ∈L∞(Ω,F , P ). Define the set function ν(E) := ρ(1E),E ∈F . Then, it follows from Axiom A2 and A3 that ν is monotonic, ν(∅) = 0, and ν(Ω) = 1. ForM ≥ 1, define LM :...

We present instances of the following phenomenon: if a product of topological spaces satisfies some given compactness property then the factors satisfy a stronger compactness property, except possibly for a small number of factors. The first known result of this kind, a consequence of a theorem by A. H. Stone, asserts that if a product is regular and Lindelöf then all but at most countably many...

Derivation of tight bounds for probability metrics and f -divergences is of interest in information theory and statistics. This paper provides elementary proofs that lead, in some cases, to significant improvements over existing bounds; they also lead to the derivation of some existing bounds in a simplified way. The inequalities derived in this paper relate between the Bhattacharyya parameter,...

We study the optimization of a binary decision system where quantized (soft) decisions are transmitted across an additive white Gaussian noise channel. We adjust the bit transmission intervals to maximize the Chernoff distance at the output of the channel. At low channel signal-to-noise ratios (when the probability of a bit error is higher), we find unequal transmission intervals yield signific...

Derivation of tight bounds for probability metrics and f -divergences is of interest in information theory and statistics. This paper provides elementary proofs that lead, in some cases, to significant improvements over existing bounds; they also lead to the derivation of some existing bounds in a simplified way. The inequalities derived in this paper relate between the Bhattacharyya parameter,...