On considère le problème de détermination de politiques optimales de publicité et de prix pour un spectacle. On suppose que les organisateurs désirent que t...

In this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with ...

The purpose of this study is to design incentives for price and advertising coordination in a bilateral monopoly. I prove that a wholesale price reduction ...

L’imitation d’une marque connue est une pratique courante et peut être légale ou illégale (dans le cas de la contrefaçon). On considère un scénario où une f...

La contrefaçon, qui peut être définie comme le fait de copier illégalement des biens de marque, est un phénomène répandu à travers le monde. Si la production...

Cet article traite de l'investissement en R&D et de contrat de licence dans une chaîne d'approvisionnement formé d'un OEM (original equipment manufacturer) ...

Most papers on digital advertising focus on the point of view of Internet companies such as Google and Microsoft, and were written by people working for thos...

We consider the problems of determining the metric dimension and the minimum cardinality of doubly resolving sets in $n$-cubes. Most heuristics develope...

We consider the multivariate linear model for multilevel data where units are nested within a hierarchy of clusters. We propose permutation procedures to te...

In this study, the problem environment consists of two fast fashion retailing firms where one can obtain the other's selling data from an outside agent. The ...

On considère un jeu dynamique représentant un canal de distribution formé d'un manufacturier et d'un détaillant où la demande dépend du prix et de la réputat...

Clustering addresses the problem of finding homogeneous and well-separated subsets, called clusters, from a set of given data points. In addition to the poi...

The $k$-means is a benchmark algorithm used in cluster analysis. It belongs to the large category of heuristics based on location-allocation steps that ...

The balanced clustering problem consists of partitioning a set of $n$ objects into $K$ equal-sized clusters as long as $n$ is a multiple of `(K...

This paper examines the issue of price and advertising coordination in bilateral monopolies from a dynamic perspective. Its main objectives are to design i...

We consider within the framework of Mean Field Games theory a dynamic discrete choice model with an advertiser, where a large number of minor agents (e.g., c...

In this paper we propose a new variant of the Variable Neighborhood Decomposition Search (VNDS) heuristic for solving global optimization problems and apply ...

Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...

The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...

We introduce an iterative algorithm for the solution of the diameter minimization clustering problem (DMCP). Our algorithm is based upon two observations: 1)...