This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001.
The focus of this chapter is on the Gen...
Effective prediction of defectprone software modules can enable software developers to focus quality assurance activities and allocate effort and resources more efficiently. Supp...
—The deployment of cognitive radio networks enables efficient spectrum sharing and opportunistic spectrum access. It also presents new challenges to the classical problem of int...
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...