Forcing and game-closed boolean algebras.

Keler, Raşit Hasan


Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria
Kazikli, Ertan; Sarıtaş, Serkan; GEZİCİ, Sinan; Linder, Tamas; Yuksel, Serdar (2022-03-01)
We investigate the equilibrium behavior for the decentralized cheap talk problem for real random variables and quadratic cost criteria in which an encoder and a decoder have misaligned objective functions. In prior work, it has been shown that the number of bins in any equilibrium has to be countable, generalizing a classical result due to Crawford and Sobel who considered sources with density supported on [0, 1]. In this paper, we first refine this result in the context of log-concave sources. For sources ...
TANRIKULU, O; KURAN, B; Özgüven, Hasan Nevzat; IMREGUN, M (1993-07-01)
The dynamic response of multiple-degree-of-freedom nonlinear structures is usually determined by numerical integration of the equations of motion, an approach which is computationally very expensive for steady-state response analysis of large structures. In this paper, an alternative semianalytical quasilinear method based on the describing function formulation is proposed for the harmonic response analysis of structures with symmetrical nonlinearities. The equations of motion are converted to a set of nonl...
Scrambling dynamics and many-body chaos in a random dipolar spin model
Keleş, Ahmet; Zhao, Erhai; Liu, W. Vincent (2019-05-01)
Is there a quantum many-body system that scrambles information as fast as a black hole? The Sachev-Ye-Kitaev model can saturate the conjectured bound for chaos, but it requires random all-to-all couplings of Majorana fermions that are hard to realize in experiments. Here we examine a quantum spin model of randomly oriented dipoles where the spin exchange is governed by dipole-dipole interactions. The model is inspired by recent experiments on dipolar spin systems of magnetic atoms, dipolar molecules, and ni...
Learning semi-supervised nonlinear embeddings for domain-adaptive pattern recognition
Vural, Elif (null; 2019-05-20)
We study the problem of learning nonlinear data embeddings in order to obtain representations for efficient and domain-invariant recognition of visual patterns. Given observations of a training set of patterns from different classes in two different domains, we propose a method to learn a nonlinear mapping of the data samples from different domains into a common domain. The nonlinear mapping is learnt such that the class means of different domains are mapped to nearby points in the common domain in order to...
Forced Response Prediction of Constrained and Unconstrained Structures Coupled Through Frictional Contacts
Ciğeroğlu, Ender; Menq, Chia-Hsiang (ASME International, 2009-03-01)
In this paper, a forced response prediction method for the analysis of constrained and unconstrained structures coupled through frictional contacts is presented. This type of frictional contact problem arises in vibration damping of turbine blades, in which dampers and blades constitute the unconstrained and constrained structures, respectively. The model of the unconstrained/free structure includes six rigid body modes and several elastic modes, the number of which depends on the excitation frequency. In o...
Citation Formats
R. H. Keler, “Forcing and game-closed boolean algebras.,” Middle East Technical University, 2002.