We consider a dynamic pricing problem where a firm sells one item to a single buyer in order to maximize expected revenues. The firm commits to a price function over an infinite horizon. The buyer arrives at some random time with a private value for the item. He is more impatient than the seller...

We consider the problem in which n items arrive to a market sequentially over time, where two agents compete to choose the best possible item. When an agent selects an item, he leaves the market and obtains a payoff given by the value of the item, which is represented by a random variable...

Dynamic resource allocation problems arise under a variety of settings and have been studied across disciplines such as Operations Research and Computer Science. The present paper introduces a unifying model for a very large class of dynamic optimization problems, that we call dynamic resource...

We consider network games with atomic players, which indicates that some players control a positive amount of flow. Instead of studying Nash equilibria as previous work has done, we consider that players with considerable market power will make decisions before the others because they can...

An important problem in electronic commerce is that of finding optimal pricing mechanisms to sell a single item when the number of buyers is random and they arrive over time. In this paper we combine ideas from auction theory and recent work on pricing with strategic consumers to derive the...

This article studies a principal-agent problem with discrete outcome and effort level spaces. The principal and the agent are risk neutral and the latter is subject to limited liability. We consider the ratio between the first-best social welfare and the social welfare arising from the...

In the traffic assignment problem, commuters select the shortest available path to travel from a given origin to a given destination. This system has been studied for over 50 years since Wardrop's seminal work. Motivated by freight companies, which need to ship goods across the network, we study...

In the traffic assignment problem, commuters select the shortest available path to travel from a given origin to a given destination. This system has been studied for over 50 years since Wardrop's seminal work (1952). Motivated by freight companies, which need to ship goods across the network,...

Companies in diverse industries have to decide the pricing policy of their inventory over time. This decision becomes particularly complex when customers accommodate their purchase decision in the hope of future discounts and promotions. With such uncertainty, many of these customers may end up...

We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney's pioneering work in 1975. We look at the problem from a...