Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
For a weakly monotone (resp., strongly monotone) upper order hemicontinuous correspondence F:A⇉A, where A is a complete lattice (resp., a σ-complete lattice), we provide tight fixed-point bounds for sufficiently large iterations Fk(a0), starting from any point a0∈A. Our results, hence, prove a generalization of the Tarski–Kantorovich theorem. We provide an application of our results to a class of social learning models on networks.