Every Choice Function Is Pro-Con Rationalizable

Dogan and Yildiz introduce analyze the pro-con model that is inspired by Franklin’s prudential algebra. Consider an agent who endowed with two sets of orderings: pro- con-orderings. For each choice set, if alternative top-ranked a pro-ordering (con-ordering), then this pro (con) for choosing alternative. The more pros than cons chosen from set. Each ordering may have weight reflecting its salience. In case, probability equals difference between total weights cons. Although, additive similar to random utility structurally invariant primitives, authors show every (random) function rational. Their technique requires generalization Ford-Fulkerson theorem. connection deterministic counterpart demonstrates fruitful use classical integer programming techniques in theory.