We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Nodes in an ad hoc wireless network incur certain costs for forwarding packets since packet forwarding consumes the resources of the nodes. If the nodes are rational, free packet f...
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...