Search results for "Bounded"
showing 10 items of 658 documents
A formal model based on Game Theory for the analysis of cooperation in distributed service discovery
2016
New systems can be designed, developed, and managed as societies of agents that interact with each other by offering and providing services. These systems can be viewed as complex networks where nodes are bounded rational agents. In order to deal with complex goals, they require cooperation of the other agents to be able to locate the required services. The aim of this paper is formally and empirically analyze under which circumstances cooperation emerges in decentralized search of services. We propose a repeated game model that formalizes the interactions among agents in a search process where agents are free to choose between cooperate or not in the process. Agents make decisions based on…
A note on symmetry reduction for circular traveling tournament problems
2011
Abstract The traveling tournament problem (TTP) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. Easton et al. (2001) introduced the so-called circular TTP instances, where venues of teams are located on a circle. The distance between neighboring venues is one, so that the distance between any pair of teams is the distance on the circle. It is empirically proved that these instances are very hard to solve due to the inherent symmetry. This note presents new ideas to cut off essentially identical parts of the solution space. Enumerative solution approaches, e.g. relying on branch-and-bound, benefit from this reduction. We…
Cognitive and Affective Consequences of Information and Choice Overload
2021
When interviewed in 1992 in Pittsburgh, Pennsylvania, the Nobel laureate Herbert Simon described a paradox at the heart of living in an economy that made every effort to design and produce ever more “choice alternatives” but that simultaneously allocated very little energy to encouraging people to devote the attention and time actually required to choose. He gave the example of a decision to buy a new house, commenting: “Before you even start the choice process, somebody has presented you with this, and this, and this house” (UBS, 1992). The overabundance of alternatives was lamented by Simon in 1992, when computing power was slower. It is all the more alarming in the modern and constantly …
Variations on Weyl's theorem
2006
AbstractIn this note we study the property (w), a variant of Weyl's theorem introduced by Rakočević, by means of the localized single-valued extension property (SVEP). We establish for a bounded linear operator defined on a Banach space several sufficient and necessary conditions for which property (w) holds. We also relate this property with Weyl's theorem and with another variant of it, a-Weyl's theorem. We show that Weyl's theorem, a-Weyl's theorem and property (w) for T (respectively T*) coincide whenever T* (respectively T) satisfies SVEP. As a consequence of these results, we obtain that several classes of commonly considered operators have property (w).
Robust optimality of linear saturated control in uncertain linear network flows
2008
We propose a novel approach that, given a linear saturated feedback control policy, asks for the objective function that makes robust optimal such a policy. The approach is specialized to a linear network flow system with unknown but bounded demand and politopic bounds on controlled flows. All results are derived via the Hamilton-Jacobi-Isaacs and viscosity theory.
ROBUST CONTROL STRATEGIES FOR MULTI—INVENTORY SYSTEMS WITH AVERAGE FLOW CONSTRAINTS
2006
Abstract In this paper we consider multi—inventory systems in presence of uncertain demand. We assume that i) demand is unknown but bounded in an assigned compact set and ii) the control inputs (controlled flows) are subject to assigned constraints. Given a long—term average demand, we select a nominal flow that feeds such a demand. In this context, we are interested in a control strategy that meets at each time all possible current demands and achieves the nominal flow in the average. We provide necessary and sufficient conditions for such a strategy to exist and we characterize the set of achievable flows. Such conditions are based on linear programming and thus they are constructive. In …
Minimal star-varieties of polynomial growth and bounded colength
2018
Abstract Let V be a variety of associative algebras with involution ⁎ over a field F of characteristic zero. Giambruno and Mishchenko proved in [6] that the ⁎-codimension sequence of V is polynomially bounded if and only if V does not contain the commutative algebra D = F ⊕ F , endowed with the exchange involution, and M , a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices , endowed with the reflection involution. As a consequence the algebras D and M generate the only varieties of almost polynomial growth. In [20] the authors completely classify all subvarieties and all minimal subvarieties of the varieties var ⁎ ( D ) and var ⁎ ( M ) . In this paper we e…
Polynomial growth and star-varieties
2016
Abstract Let V be a variety of associative algebras with involution over a field F of characteristic zero and let c n ⁎ ( V ) , n = 1 , 2 , … , be its ⁎-codimension sequence. Such a sequence is polynomially bounded if and only if V does not contain the commutative algebra F ⊕ F , endowed with the exchange involution, and M, a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices. Such algebras generate the only varieties of ⁎-algebras of almost polynomial growth, i.e., varieties of exponential growth such that any proper subvariety is polynomially bounded. In this paper we completely classify all subvarieties of the ⁎-varieties of almost polynomial growth by gi…
The Hermitian part of a Rickart involution ring, I
2014
Rickart *-rings may be considered as a certain abstraction of the rings B(H) of bounded linear operators of a Hilbert space H. In 2006, S. Gudder introduced and studied a certain ordering (called the logical order) of self-adjoint Hilbert space operators; the set S(H) of these operators, which is a partial ring, may be called the Hermitian part of B(H). The new order has been further investigated also by other authors. In this first part of the paper, an abstract analogue of the logical order is studied on certain partial rings that approximate the Hermitian part of general *-rings; the special case of Rickart *-rings is postponed to the next part.
Superalgebras with Involution or Superinvolution and Almost Polynomial Growth of the Codimensions
2018
Let A be a superalgebra with graded involution or superinvolution ∗ and let $c_{n}^{*}(A)$, n = 1,2,…, be its sequence of ∗-codimensions. In case A is finite dimensional, in Giambruno et al. (Algebr. Represent. Theory 19(3), 599–611 2016, Linear Multilinear Algebra 64(3), 484–501 2016) it was proved that such a sequence is polynomially bounded if and only if the variety generated by A does not contain the group algebra of $\mathbb {Z}_{2}$ and a 4-dimensional subalgebra of the 4 × 4 upper-triangular matrices with suitable graded involutions or superinvolutions. In this paper we study the general case of ∗-superalgebras satisfying a polynomial identity. As a consequence we classify the varie…