Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
The no-information case of a finite horizon joint search problem between two players with conflicting preferences is studied. It is shown that if the players have convex preferences and are patient enough, then they abandon their search by accepting the first period alternative.