15771 research outputs found
Sort by
Zones franches et chaine de valeurs : le modèle « Zone Franche de Manaus »
No full textActes du 8e colloque international, Rabat, 20-22 novembre 2014 organisé à la Faculté des Sciences Juridiques, Economiques et Sociales de Souissi (Université Mohamed V)nonouirechercheInternationa
Regional Trade Agreements and the Spread of International Labours Standards
No full textProgramme NOPOORIn the last two decades, international trade agreements havedriven growing economic integration increasingly inclusive of social andlabour provisions. This article investigates the link between labourclauses in trade agreements and national labour standards, comparingtheir effects on the ratification of ILO conventions and worker rightspractices. An empirical estimation using panel data for 141 countriesfrom 1980 to 2013 suggests that labour provisions have not played asignificant role in the improvement of labour practices, and that theireffect has been limited to the ratification of ILO conventions. This gaphighlights the importance of mechanisms that guarantee theenforceability of labour clauses included in trade agreements.nonouirechercheInternationa
Creating a Winner's Curse via Jump Bids
No full textWe show that jump bids can be used by a bidder to create a winner’s curse and preserve an informational advantage that would otherwise disappear in the course of an open ascending auction. The effect of the winner’s curse is to create allocative distortions and reduce the seller’s expected revenue. Two novel features of equilibrium jump bids are derived. First, the jump bid may fail to hide completely the value of the common value component. Second, a bidder with a higher type might jump bid less frequently than a bidder with a lower type.nonnonouirechercheInternationa
Biens publics et concurrence : bref inventaire des fruits d’une union de raison
No full textnonouinon-rechercheNationa
Strategic Coloring of a Graph
No full textWe study a strategic game in which every node of a graph is owned by a player who has to choose a color. A player’s payoff is 0 if at least one neighbor selected the same color; otherwise, it is the number of players who selected the same color. The social cost of a state is defined as the number of distinct colors that the players use. It is ideally equal to the chromatic number of the graph, but it can substantially deviate because every player cares about his own payoff, however bad the social cost may be. Following previous work in [Panagopoulou and Spirakis 08] on the Nash equilibria of the coloring game, we give worst-case bounds on the social cost of stable states. Our main contribution is an improved (tight) bound for the worst-case social cost of a Nash equilibrium, as well as the study of strong equilibria, their existence, and how far they are from social optima.nonouirechercheInternationa
SimSearch: similarity search framework based on indexing techniques in metric spaces
No full textSimilarity search in metric spaces refers to searching elements in data repositories that are similar to an element supplied by the user (query example). Similarity functions are used to determine which elements in the data repositories are similar to the query example and indexing mechanisms are used to improve the efficiency in the search. Classic indexation mechanisms such as LSH, M-Index, and M-Tree behave different according to the dimensionality in the metric space, volume of data repositories, and query strategies. In this paper, we describe SimSearch, a modular and flexible framework for similarity search in metric spaces, which allows to use, analyse, compare, and add several indexation mechanisms, search approaches, and query strategies. SimSearch allows doing queries given one or more example elements to obtain the set of elements more similar to the query examples, using query composition and Skyline. We show the variability of performance of several indexation mechanisms, including LSH-ML (our proposed variant of LSH), with experimental study in the domain of images represented by a feature vector in a high dimensionality metric space and Web Services represented by a vector with the values of Quality of Service (QoS) parameters.nonouirechercheInternationa
Object detection and localization using a knowledge graph on spatial relationships
No full textA knowledge on spatial relationships between objects present in a given collection of images can provide interesting information to improve classical CBIR tasks such as object detection and localization, by reducing the searching areas of the object relatively to one or several given objects. In this paper, we propose a representation of the knowledge on relationships existing between symbolic objects in a collection of images. None exhaustively, these relationships can be co-occurrences of objects or different kinds of spatial relationships between them in images. We present a graph-based representation of this knowledge and its associated operations and properties. This work was evaluated on the public symbolic image database LabelMe. The experiments show its relevance for object detection and localization.nonouirechercheInternationa
Playout Policy Adaptation with Move Features
No full textMonte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). We propose to learn a playout policy online so as to improve MCTS for GGP. We also propose to learn a policy not only using the moves but also according to the features of the moves. We test the resulting algorithms named Playout Policy Adaptation (PPA) and Playout Policy Adaptation with move Features (PPAF) on Atarigo, Breakthrough, Misere Breakthrough, Domineering, Misere Domineering, Knightthrough, MisereKnightthrough and Nogo. The experiments compare PPA and PPAF to Upper Confidence for Trees (UCT) and to the closely related Move-Average Sampling Technique (MAST) algorithm.nonouirechercheInternationa
Generalized Rapid Action Value Estimation
No full textMonte Carlo Tree Search (MCTS) is the state of the art algorithm for many games including the game of Go and General Game Playing (GGP). The standard algorithm for MCTS is Upper Confidence bounds applied to Trees (UCT). For games such as Go a big improvement over UCT is the Rapid Action Value Estimation (RAVE) heuristic. We propose to generalize the RAVE heuristic so as to have more accurate estimates near the leaves. We test the resulting algorithm named GRAVE for Atarigo, Knighthrough, Domineering and Go.nonouirechercheInternationa
Modelling preferences
No full textThis chapter deals with a crucial step in the decision aiding process: the aggregation of the alternatives’ performances on each criterion in order to faithfully model the overall preference of the decision maker. The approach we follow is that of conjoint measurement, which aims at determining under which conditions a preference can be represented in a particular aggregation model. This approach is first illustrated with the classical additive value function model. Then, we describe two broad families of preference models, which constitute a framework encompassing many aggregation models used in practice. The aggregation rules that fit with the second family of models rely on the aggregation of preference differences. Among this family we find, in particular, models for the outranking relations (concordance relations with vetoes) that are used in several case studies in this book.nonouirechercheInternationa