Some open problems in metric continuum theory are discussed. They concern 1) generalized homogeneity, in particular monotone homogeneity of dendrites; 2) planability of curves; 3) means on continua; 4) contractibility of continua; and 5) selectibility of continua.

LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form pv(P, G, n) which is a success if a query G can be proved from the web page P within n proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we p...

We study learning in Bayesian games (or games with differential information) with an arbitrary number of bounded rational players, i.e., players who choose approximate best response strategies [approximate Bayesian Nash Equilibrium (BNE) strategies] and who also are allowed to be completely irrational in some states of the world. We show that bounded rational players by repetition can reach a l...

Bounded Max-Sum is a message-passing algorithm for solving Distributed Constraint Optimization Problems able to compute solutions with a guaranteed approximation ratio. Although its approximate solutions were empirically proved to be within a small percentage of the optimal solution on low and moderately dense problems, in this paper we show that its theoretical approximation ratio is overestim...

this paper continues the investigation of the rst author begun in part one. the hereditary properties of n-homomorphism amenability for banach algebras are investigated and the relations between n-homomorphism amenability of a banach algebra and its ide- als are found. analogous to the character amenability, it is shown that the tensor product of two unital banach algebras is n-homomorphism am...