Fixed points, selections and best approximation for multivalued mappings in \(R\)-trees (Q2643464)

An \(R\)-tree is a metric space \(M\) such that there is a unique segment \([x,y]\) joining each pair of points \(x,y \in M\) and, if \([y,x]\cap [x,z]=\{x\}\), then \([y,x]\cup [x,z]= [y,z]\). A subset \(X\) of \(M\) is called convex if \(X\) includes every geodesic segment joining any two of its points. Several results concerning selections, best approximation and fixed points for multifunctions with convex values are presented. In particular, if \(M\) is a complete \(R\)-tree, then every almost lower semicontinuous multifunction with closed bounded convex values admits a continuous selection. Moreover, if the multifunction is nonexpansive, then it admits a fixed point.