The following definition is due to Mathieu Dupont.
The “if” direction is clearly true even without exactness: given an eso where is discrete and is groupoidal, find an eso where is discrete, and then split the composite . Conversely, since discrete objects are groupoidal, the axiom of 2-choice clearly implies the ordinary axiom of choice (“1-choice”) for . So it remains only to prove that 2-choice implies the existence of enough discretes in .
The obvious approach is: given , we construct its discrete reflection . Then by assumption, the eso admits a splitting , which we would like to show is also eso. Since the discretization of is an isomorphism, so is the discretization of its splitting, so it would suffice to know that for a map in a (2,1)-exact (2,1)-category, if the discretization of is an isomorphism, then is eso.