In a live and bounded Free Choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded Free Choice net, this property is true for any transition of the net. Consider now a live and bounded stochastic routed Free Choice net, and assume that the routings and the firing ti...

724 In 1981, an internal study by American Airlines found that travel agents booked the first flight that appeared on their computer screen 53 percent of the time, and a flight that appeared somewhere on the first screen almost 92 percent of the time. This provided an incentive for American to manipulate the order in which flights were listed on American’s “Sabre” computer reservation system, w...

Early studies of intuitive judgment and decision making conducted with the late Amos Tversky are reviewed in the context of two related concepts: an analysis of accessibility, the ease with which thoughts come to mind; a distinction between effortless intuition and deliberate reasoning. Intuitive thoughts, like percepts, are highly accessible. Determinants and consequences of accessibility help...

I study how limited abilities to process information affect choice behavior. I model the decision making process by an automaton, and measure the complexity of a specific choice rule by the minimal number of categories an automaton implementing the rule uses to process information. I establish that any choice rule that is less complicated than utility maximization displays framing effects. I th...

The Ornstein–Uhlenbeck (O–U) model has been successfully applied to describe the response accuracy and response time in 2-alternative choice tasks. This paper analyses properties and performance of variants of the O–U model with absorbing and reflecting boundary conditions that limit the range of possible values of the integration variable. The paper focuses on choice tasks with pre-determined ...

This paper is devoted to complexity results regarding specific measures of proximity to singlepeakedness and single-crossingness, called “singlepeaked width” [Cornaz et al., 2012] and “singlecrossing width”. Thanks to the use of the PQ-tree data structure [Booth and Lueker, 1976], we show that both problems are polynomial time solvable in the general case (while it was only known for single-pea...