Computationally Manageable Combinatorial Auctions the Authors Gratefully Acknowledge the National Science Foundation for Its Support under Grant Number Sbr 93-09333 to Rutgers University Aliated Graduate Student Member, Dimacs Graduate Assistant

There is interest in designing simultaneous auctions for situations in which the value of assets to a bidder depends upon which other assets he or she wins. In such cases, bidders may well wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of noncon icting bids can be a di cult one. We analyze this problem, identifying several di erent structures of combinatorial bids for which computational tractability is constructively demonstrated and some structures for which computational tractability