We consider an agent who has to repeatedly make choices in an uncertain and changing environment, who has full information of the past, who discounts future payoffs, but who has no prior. We provide a learning algorithm that performs almost as well as the best of a given finite number of experts...

This paper introduces a mixture model based on the beta distribution, without preestablished means and variances, to analyze a large set of Beauty-Contest data obtained from diverse groups of experiments (Bosch-Domenech et al. 2002). This model gives a better t of the experimental data, and more...

Minimax lower bounds for concept learning state, for example, that for each sample size $n$ and learning rule $g_n$, there exists a distribution of the observation $X$ and a concept $C$ to be learnt such that the expected error of $g_n$ is at least a constant times $V/n$, where $V$ is the VC...

The classical binary classification problem is investigated when it is known in advance that the posterior probability function (or regression function) belongs to some class of functions. We introduce and analyze a method which effectively exploits this knowledge. The method is based on...

This paper investigates the link between brand performance and cultural primes in high-risk, innovation-based sectors. In theory section, we propose that the level of cultural uncertainty avoidance embedded in a firm determine its marketing creativity by increasing the complexity and the...

To understand whether retailers should consider consumer returns when merchandising, we study how the optimal assortment of a price-taking retailer is influenced by its return policy. The retailer selects its assortment from an exogenous set of horizontally differentiated products. Consumers...

Revenue management practices often include overbooking capacity to account for customers who make reservations but do not show up. In this paper, we consider the network revenue management problem with no-shows and overbooking, where the show-up probabilities are specific to each product....

The network choice revenue management problem models customers as choosing from an offer-set, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear...

Models incorporating more realistic models of customer behavior, as customers choosing from an offer set, have recently become popular in assortment optimization and revenue management. The dynamic program for these models is intractable and approximated by a deterministic linear program called...

Firms compete by choosing both a price and a design from a family of designs that can be represented as demand rotations. Consumers engage in costly sequential search among firms. Each time a consumer pays a search cost he observes a new offering. An offering consists of a price quote and a new...