Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alfio Giarlotta has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Simon’s bounded rationality

    by Alfio Giarlotta, Angelo Petralia

    This note in the Milestones series is dedicated to the paper “A Behavioral Model of Rational Choice”, written by Herbert Simon and published in 1955 on the Quarterly Journal of Economics.


  • Open Access

    Christian Klamler’s ”A distance measure for choice functions” [Social Choice and Welfare 30 (2008) 419–425]: a correction

    by Davide Carpentiere, Alfio Giarlotta, Stephen Watson

    An extensive choice over X is a function assigning to any subset S of X a possibly empty subset of S. Klamler (Soc Choice Welf 30:419–425, 2008) shows that the operation of symmetric difference induces a metric on the family of extensive choices over X, and this metric is characterized by five axioms –. We provide counterexamples to Klamler’s result, suggest a slight modification of axioms and to obtain a correct characterization, and finally observe that axiom is redundant.


  • Open Access

    Rationalization of indecisive choice behavior by pluralist ballots

    by José Carlos R. Alcantud, Domenico Cantone, Alfio Giarlotta, Stephen Watson


  • Open Access

    Extending rational choice behavior: The decision problem for Boolean set theory with a choice correspondence

    by Domenico Cantone, Alfio Giarlotta, Pietro Maugeri, Stephen Watson

    Given the family $P$ of all nonempty subsets of a set $U$ of alternatives, a choice over $U$ is a function $c \colon \Omega \to P$ such that $\Omega \subseteq P$ and $c(B) \subseteq B$ for all menus $B \in \Omega$. A choice is total if $\Omega = P$, and partial otherwise. In economics, an agent is considered rational whenever her choice behavior satisfies suitable axioms of consistency, which are properties quantified over menus. Here we address the following lifting problem: Given a partial choice satisfying one or more axioms of consistency, is it possible to extend it to a total choice satisfying the same axioms? After characterizing the lifting of some choice properties that are well-known in the economics literature, we study the decidability of the connected satisfiability problem for unquantified formulae of an elementary fragment of set theory, which involves a choice function symbol, the Boolean set operators, the singleton, the equality and inclusion predicates, and the propositional connectives. In two cases we prove that the satisfiability problem is NP-complete, whereas in the remaining cases we obtain NP-completeness under the additional assumption that the number of choice terms is constant.

  • Open Access

    Rationalization of indecisive choice behavior by majoritarian ballots

    by José Carlos R. Alcantud, Domenico Cantone, Alfio Giarlotta, Stephen Watson

    We describe a model that explains possibly indecisive choice behavior, that is, quasi-choices (choice correspondences that may be empty on some menus). The justification is here provided by a proportion of ballots, which are quasi-choices rationalizable by an arbitrary binary relation. We call a quasi-choice $s$-majoritarian if all options selected from a menu are endorsed by a share of ballots larger than $s$. We prove that all forms of majoritarianism are equivalent to a well-known behavioral property, namely Chernoff axiom. Then we focus on two paradigms of majoritarianism, whereby either a simple majority of ballots justifies a quasi-choice, or the endorsement by a single ballot suffices - a liberal justification. These benchmark explanations typically require a different minimum number of ballots. We determine the asymptotic minimum size of a liberal justification.

  • Open Access

    Semantics meets attractiveness: Choice by salience

    by Alfio Giarlotta, Angelo Petralia, Stephen Watson

    We describe a context-sensitive model of choice, in which the selection process is shaped not only by the attractiveness of items but also by their semantics ('salience'). All items are ranked according to a relation of salience, and a linear order is associated to each item. The selection of a single element from a menu is justified by one of the linear orders indexed by the most salient items in the menu. The general model provides a structured explanation for any observed behavior, and allows us to to model the 'moodiness' of a decision maker, which is typical of choices requiring as many distinct rationales as items. Asymptotically all choices are moody. We single out a model of linear salience, in which the salience order is transitive and complete, and characterize it by a behavioral property, called WARP(S). Choices rationalizable by linear salience can only exhibit non-conflicting violations of WARP. We also provide numerical estimates, which show the high selectivity of this testable model of bounded rationality.

  • Open Access

    Bounded rationality is rare

    by Alfio Giarlotta, Angelo Petralia, Stephen Watson


  • Open Access

    Semantics Meets Attractiveness: Choice by Salience

    by Angelo Petralia, Alfio Giarlotta, Stephen Watson

    We describe a context-sensitive model of choice, in which the selection process is shaped not only by the attractiveness of items but also by their semantics (‘salience’). Items are ranked according to a binary relation of salience, and a linear order is associated to each item. The selection of a unique element from a menu is justified by one of the linear orders associated to the most salient items in the menu. The general model provides a structured explanation for any behavior, and allows us to model a notion of ‘moodiness’ of the decision maker, typical of choices requiring as many distinct rationales as items. Asymptotically, all choices are moody. We single out a model of linear salience, in which the order encoding semantics is transitive and complete. Choices rationalizable by linear salience can only exhibit non-conflicting violations of WARP. Numerical estimates show the sharp selectivity of this testable model.

  • Open Access

    Choice resolutions

    by Domenico Cantone, Alfio Giarlotta, Stephen Watson

    We describe a process to compose and decompose choice behavior, called resolution. In the forward direction, resolutions amalgamate simple choices to create a complex one. In the backward direction, resolutions detect when and how a primitive choice can be deconstructed into smaller choices. A choice is resolvable if it is the resolution of smaller choices. Rationalizability, rationalizability by a preorder, and path independence are all preserved (backward and forward) by resolutions, whereas rationalizability by a weak order (equivalently, ) is not. We characterize resolvable choices, and show that resolvability generalizes .