We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a two-dimensional type that reflects his capacity requirement and his willingness to pay...

This paper decomposes price into its 2 major constituents, namely markup (Mkp) and marginal cost (MC) with which a Markov-switching VAR with fixed transition probabilities is estimated. Since the proposed pair of variables has not been extensively analysed, a theoretical model that derives...

Linear programming is an important method for computing solutions to private information problems. The method is applicable for arbitrary specifications of the preferences and technology. Unfortunately, as the cardinality of underlying sets increases the programs quickly become too large to...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...