Convexity of integer veto and elimination procedures (Q1111437)

Elimination procedures generated by a marginal contribution in an integer veto function implement through sincere (respectively sincere and sophisticated) behavior the core correspondence of the veto function if the latter is convex (respectively additive). Moreover a partial converse of this result is proved. A characterization of a subclass of convex (respectively additive) veto functions is thus obtained.