It is evident that linear programming model remains the most potent mathematical tool for the efficient allocation of scarce operational resources of an organization. Whilst projecting the graphical method as the easiest solution approach to linear programming where only two constraining factors...

Expected consumer's surplus rarely represents preferences over price lotteries. Still, I give sufficient conditions for policies which maximize aggregate expected surplus to be interim Pareto Optimal. Besides two standard partial equilibrium conditions, I assume that feasible prices satisfy a...

In ordinal (probabilistic) assignment problems, each agent reports his preference rankings over objects and receives a lottery defined over those objects. A common efficiency notion, sd-efficiency, is obtained by extending the preference rankings to preferences over lotteries by means of...

We allocate objects to agents as exemplified primarily by school choice. Welfare judgments of the object-allocating agency are encoded as edge weights in the acceptability graph. The welfare of an allocation is the sum of its edge weights. We introduce the constrained welfare-maximizing...

We investigate the incentives for capacity investments in a simple strategic dynamic model with random demand growth. We construct non-collusive Markovian equilibria where the firms' decisions depend on the current capacity stock only. The firms maintain small reserve margins and high market...

We model a market, such as an online software market, in which an intermediary connects sellers and buyers by displaying sellers' products. With two vertically-differentiated products, an intermediary can place either: (1) one product, not necessarily the better one, on the first page, and the...

This paper determines the optimal timing of dike heightenings as well as the corresponding optimal dike heightenings to protect against floods. To derive the optimal policy we design an algorithm based on the Impulse Control Maximum Principle. In this way the paper presents one of the first real...

We study the optimal design of a queueing system when agents' arrival and servicing are governed by a general Markov process. The designer of the system chooses entry and exit rules for agents, their service priority---or queueing discipline---as well as their information, while ensuring that...

In part I of this paper, we proposed a Mixed-Integer Linear Program (MILP) to analyze imperfect competition of oligopoly producers in two-stage zonal power markets. In part II of this paper, we propose a solution algorithm which decomposes the proposed MILP model into several subproblems and...