Quantum-like models cannot account for the conjunction fallacy

Human agents happen to judge that a conjunction of two terms is more probable than one of the terms, in contradiction with the rules of classical probabilities---this is the conjunction fallacy. One of the most discussed accounts of this fallacy is currently the quantum-like explanation, which relies on models exploiting the mathematics of quantum mechanics. The aim of this paper is to investigate the empirical adequacy of major quantum-like models which represent beliefs with quantum states. We first argue that they can be tested in three different ways, in a question order effect configuration which is different from the traditional conjunction fallacy experiment. We then carry out our proposed experiment, with varied methodologies from experimental economics. The experimental results we get are at odds with the predictions of the quantum-like models. This strongly suggests that this quantum-like account of the conjunction fallacy fails. Future possible research paths are discussed

Testing quantum-like models of judgment for question order effect

Lately, so-called "quantum" models, based on parts of the mathematics of quantum mechanics, have been developed in decision theory and cognitive sciences to account for seemingly irrational or paradoxical human judgments. We consider here some such quantum-like models that address question order effects, i.e. cases in which given answers depend on the order of presentation of the questions. Models of various dimensionalities could be used, can the simplest ones be empirically adequate? From the quantum law of reciprocity, we derive new empirical predictions that we call the Grand Reciprocity equations, that must be satisfied by several existing quantum-like models, in their non-degenerate versions. Using substantial existing data sets, we show that these non-degenerate versions fail the GR test in most cases, which means that, if quantum-like models of the kind considered here are to work, it can only be in their degenerate versions. However, we suggest that the route of degenerate models is not necessarily an easy one, and we argue for more research on the empirical adequacy of degenerate quantum-like models in general.Comment: 29 pages, 5 figures, 7 table

L’atelier gallo-romain de pierres à aiguiser du Châtelet-sur-Sormonne (Ardennes)

International audienc

Automatic Nested Spatial Entity and Spatial Relation Extraction From Text for Knowledge Graph Creation: A Baseline Approach and a Benchmark Dataset

International audienceAutomatically extracting geographic information from text is the key to harnessing the vast amount of spatial knowledge that only exists in this unstructured form. The fundamental elements of spatial knowledge include spatial entities, their types and the spatial relations between them. Structuring the spatial knowledge contained within text as a geospatial knowledge graph, and disambiguating the spatial entities, significantly facilitates its reuse. The automatic extraction of geographic information from text also allows the creation or enrichment of gazetteers. We propose a baseline approach for nested spatial entity and binary spatial relation extraction from text, a new annotated French-language benchmark dataset on the maritime domain that can be used to train algorithms for both extraction tasks, and benchmark results for the two tasks carried out individually and end-to-end. Our approach involves applying the Princeton University Relation Extraction system (PURE), made for flat, generic entity extraction and generic binary relation extraction, to the extraction of nested, spatial entities and spatial binary relations. By extracting nested spatial entities and the spatial relations between them, we have more information to aid entity disambiguation. In our experiments we compare the performance of a pretrained monolingual French BERT language model with that of a pretrained multilingual BERT language model, and study the effect of including cross-sentence context. Our results reveal very similar results for both models, although the multilingual model performs slightly better in entity extraction, and the monolingual model has slightly better relation extraction and end-to-end perfor- mances. We observe that increasing the amount of cross-sentence context improves the results for entity extraction whereas it has the opposite effect on relation extraction

Ice sliding games

International audienceThis paper deals with sliding games, which are a variant of the better known pushpush game. On a given structure (grid, torus...), a robot can move in a specific set of directions, and stops when it hits a block or boundary of the structure. The objective is to place the minimum number of blocks such that the robot can visit all the possible positions of the structure. In particular, we give the exact value of this number when playing on a rectangular grid and a torus. Other variants of this game are also considered, by constraining the robot to stop on each case, or by replacing blocks by walls

Smash and Grab: the 0.6 Scoring Game on Graphs

In this paper, we introduce and study a new scoring game on graphs called SMASH AND GRAB. In this game, two players, called Left and Right, take turns removing a vertex of the graph as well as all of its neighbours that become isolated by this removal. For each player and each of their turns, they score the number of vertices that were removed on their turn. The game ends when there are no more vertices remaining, and the player with the highest final score wins. We denote by $Ls(G)$ the difference between Left and Right's final scores in $G$ when Left starts and both players play optimally (they both aim to maximise their scores). We mainly study this parameter for different graph classes. We notably prove that $Ls(F) ≥ 0$ for any forest $F$ (i.e., the first player cannot lose). We then use this result to compute the exact value of $Ls(G)$ for particular forests such as unions of paths and subdivided stars. The result in paths then solves the case of a unique cycle. Finally, we prove that, for a generalisation of the game, computing the score is PSPACE-complete

Phenology : follow the internal clock of the vines

Le développement de la vigne au cours de l’année est rythmé par l’apparition de stades clés comme le débourrement, la floraison et la véraison. Leur suivi précis à l’échelle d’un vignoble est indispensable pour une gestion technique performante. Il permet de connaître la précocité relative des parcelles d’une exploitation, de caractériser le millésime en cours et de positionner avec précision les opérations techniques comme les traitements phytosanitaires

Genetic variability of grapevine vegetative development parameters as described with LiDAR data and associated quantitative trait loci

International audienc