We study a single-machine scheduling problem that is a generalization of a number of problems for which computational procedures have already been published. Each job has a processing time, a release date, a due date, a deadline and a weight representing the penalty per unit-time delay beyond...

This paper focuses on revealed preference tests of the collective model of household consumption. We start by showing that the decision problems corresponding to testing collective rationality are NP-complete. This makes the application of these tests problematic for (increasingly available)...

In this work, we study the assortment planning games in which multiple retailers interact in the market. Each retailer owns some of the products and their goal is to select a subset of products, i.e., an assortment to o er to the customers so as to maximize their expected revenue. The purchase...

{Problem Definition:} This paper considers the operational management problems under a newly proposed choice model that captures the effect of focality. The offered assortment is separated into the focal set and the non-focal set under this new model due to the bias of focality, which is...