نتایج جستجو برای: strong continuity

تعداد نتایج: 405560  

Journal: :Social Choice and Welfare 2009
Kentaro Hatsumi Shigehiro Serizawa

We consider the allotment problem of homogeneous indivisible goods among agents with single-peaked and risk-averse von NeumannMorgenstern expected utility functions. We establish that a rule satisfies coalitional strategy-proofness, same-sideness, and strong symmetry if and only if it is the uniform probabilistic rule. By constructing an example, we show that if same-sideness is replaced by res...

Journal: :SIAM Journal on Optimization 2007
Chong Li K. F. Ng Ting Kei Pong

We consider a (finite or infinite) family of closed convex sets with nonempty intersection in a normed space. A property relating their epigraphs with their intersection’s epigraph is studied, and its relations to other constraint qualifications (such as the linear regularity, the strong CHIP, and Jameson’s (G)-property) are established. With suitable continuity assumption we show how this prop...

2005
ASSIA GUEZANE-LAKOUD

In this work, we study an abstract boundary-value problem generated by an evolution equation and a non-local boundary condition. We prove the existence and uniqueness of the strong generalized solution and its continuity to respect to the parameters. The proofs are obtained via a priori estimates in non classical functional spaces and on the density of the range of the operator generated by the...

Journal: :Scientific American 1913

In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on  a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of  level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...

For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...

Journal: :J. Multivariate Analysis 2016
Anuradha Roy Roman Zmyslony Miguel Fonseca Ricardo Leiva

The paper deals with the best unbiased estimators of the blocked compound symmetric covariance structure for m−variate observations over u sites under the assumption of multivariate normality. The free-coordinate approach is used to prove that the quadratic estimation of covariance parameters is equivalent to linear estimation with a properly defined inner product in the space of symmetric matr...

Journal: :EJGTA 2015
Shariefuddin Pirzada Muhammad Ali Khan Guofei Zhou Koko K. Kayibi

A k-hypertournament is a complete k-hypergraph with each k-edge endowed with an orientation, that is, a linear arrangement of the vertices contained in the edge. In a k-hypertournament, the score si (losing score ri) of a vertex vi is the number of arcs containing vi in which vi is not the last element (in which vi is the last element). The total score of vi is defined as ti = si − ri. In this ...

Journal: :Animal Sentience 2017

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید