We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...
An increasing number of providers are offering utility computing services which require users to pay only when they use. Most of these providers currently charge users for metere...
Financial options whose payoff depends critically on historical prices are called pathdependent options. Their prices are usually harder to calculate than options whose prices do ...
Auctions and exchanges are important coordination mechanisms for multiagent systems. Most multi-good markets are combinatorial in that the agents have preferences over bundles of ...
Abstract— We compare two alternative mechanisms for capping prices in two-settlement electricity markets. With sufficient lead time and competitive entry opportunities, forward ...
Jian Yao, Bert Willems, Shmuel S. Oren, Ilan Adler
With the advent of e-Commerce, enterprises can no longer rely on static business strategies. They have to be able to cope in dynamic and uncertain electronic environments, especia...
We study the problem of identifying prices to support a given allocation of items to bidders in an envy-free way. A bidder will envy another bidder if she would prefer to obtain th...