The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...

The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...

We study optimal experimentation by a monopolistic platform in a two-sided market framework. The platform provider faces uncertainty about the strength of the externality each side is exerting on the other. It maximizes the expected present value of its profit stream in a continuous-time...

Abstract: We develop a theory of imperfect competition with loss-averse consumers. All consumers are fully informed about match value and price at the time they make their purchasing decision. However, a share of consumers are initially uncertain about their tastes and form a reference point...