Outputs (3)

Kalai and Muller's Possibility Theorem: A Simplified Integer Programming Version (2018)
Journal Article
Busetto, F., Codognato, G., & Tonin, S. (2018). Kalai and Muller's Possibility Theorem: A Simplified Integer Programming Version. Review of Economic Design, 22(3-4), 149-157. https://doi.org/10.1007/s10058-018-0214-3

We provide a respecification of an integer programming characterization of Arrovian social welfare functions introduced by Sethuraman et al. (Math Oper Res 28:309–326, 2003). By exploiting this respecification, we give a new and simpler proof of Theo... Read More about Kalai and Muller's Possibility Theorem: A Simplified Integer Programming Version.

Integer Programming on Domains Containing Inseparable Ordered Pairs (2018)
Journal Article
Busetto, F., Codognato, G., & Tonin, S. (2018). Integer Programming on Domains Containing Inseparable Ordered Pairs. Research in Economics, 72(4), 428-434. https://doi.org/10.1016/j.rie.2018.08.001

Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend the analysis of the preference domains containing an inseparable ordered pair, initiated by Kalai and Ritz (1978). We show that these domains admit not... Read More about Integer Programming on Domains Containing Inseparable Ordered Pairs.

Noncooperative oligopoly in economies with infinitely many commodities and traders (2018)
Journal Article
Ghosal, S., & Tonin, S. (2018). Noncooperative oligopoly in economies with infinitely many commodities and traders. Games and Economic Behavior, 109, 184-200. https://doi.org/10.1016/j.geb.2017.12.015

In this paper, we extend the noncooperative analysis of multilateral oligopoly to exchange economies with infinitely many commodities and trader types where exchange is modelled using a strategic market game with commodity money and trading posts. We... Read More about Noncooperative oligopoly in economies with infinitely many commodities and traders.