Results 1 to 10 of about 99,568 (264)
We introduce a non-cooperative game model in which players’ decision nodes are partially ordered by a dependence relation, which directly captures informational dependencies in the game. In saying that a decision node v is dependent on decision nodes v1,…,vk, we mean that the information available to a strategy making a choice at v is precisely the ...
Valeria Zahoransky +3 more
openaire +4 more sources
On the heapability of finite partial orders [PDF]
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a ...
János Balogh +4 more
doaj +1 more source
Equivalence, Partial Order and Lattice of Neighborhood Sequences on the Triangular Grid
In (digital) grids, neighbor relation is a crucial concept; digital distances are based on paths through neighbor points. Digital distances are significant, e.g., in digital image processing for giving an approximation of the Euclidean distance and ...
Benedek Nagy
doaj +1 more source
On contraction coefficients, partial orders and approximation of capacities for quantum channels [PDF]
The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of many results in
Christoph Hirche +2 more
doaj +1 more source
The Upper and Lower Solution Method for a Class of Interval Boundary Value Problems
In this paper, the upper and lower solution method is proposed in order to solve the second order interval boundary value problem. We study first a class of linear interval boundary value problems and then investigate a class of nonlinear interval ...
Yanzong Yan, Zhiyong Xiao, Zengtai Gong
doaj +1 more source
Reliability Properties of the NDL Family of Discrete Distributions with Its Inference
The natural discrete Lindley (NDL) distribution is an intuitive idea that uses discrete analogs to well-known continuous distributions rather than using any of the published discretization techniques. The NDL is a flexible extension of both the geometric
Mohammed Mohammed Ahmed Almazah +3 more
doaj +1 more source
Pseudo o-Minimality for Double Stone Algebras [PDF]
Pseudo o-minimality is a generalization of o-minimality of linear orders to partial orders. Recently Lei Chen, Niandong Shi and Guohua Wu provided pseudo o-minimality for the class of Stone algebras. In this note we use quantifier elimination property to
Farhad Jahanian, Jafar Sadegh Eivazloo
doaj +1 more source
Partially Ordered Models [PDF]
54 pages, 11 figures, 6 simulations.
Fernandez, R., Deveaux, V.
openaire +4 more sources
A new partial order based on core partial order and star partial order
Summary: In this paper, we introduce a new partial order called CS partial order, which is based on the core partial order and star partial order. We give some characteristics of CS partial order by using polar decomposition. Then we apply the polar-like decomposition to introduce another new partial order called WC (weak CS) partial order, which is an
Zhang, Yang, Jiang, Zongyang
openaire +1 more source
Orders between Channels and Implications for Partial Information Decomposition
The partial information decomposition (PID) framework is concerned with decomposing the information that a set of random variables has with respect to a target variable into three types of components: redundant, synergistic, and unique.
André F. C. Gomes +1 more
doaj +1 more source

