Computationally Manageable Combinational Auctions

Published Online:https://doi.org/10.1287/mnsc.44.8.1131

References

  • Ahuja R. K. , Magnanti T. L. , Orlin J. B. Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Banks J. , Ledyard J. O. , Porter D. Allocating uncertain and unresponsive resources: An experimental approach. RAND J. Econom (1989) 20 1 23 CrossrefGoogle Scholar
  • Bartholdi J. J. III. , Orlin J. B. , Ratliff D. H. Cyclic scheduling via integer programs with circular ones. Oper. Res. (1980) 28 1074 1085 LinkGoogle Scholar
  • Berman F. , Johnson D. , Leighton T. , Shor P. W. , Snyder L. Generalized planar matching. J. Algorithms (1990) 11 153 184 CrossrefGoogle Scholar
  • Bondy J. A. , Murty U. S. R. Graph Theory with Applications (1976) (American Elsevier, New York) CrossrefGoogle Scholar
  • Branco F. Multi-object auctions: On the use of combinational bids. (1995) . Discussion paper 1216, Center for Economic Policy Research, London Google Scholar
  • Bykowsky M. M. , Cull R. J. , Ledyard J. O. Mutually destructive bidding: The FCC auction design problem. (1995) . Social science working paper 916, California Institute of Technology, Pasadena Google Scholar
  • Campbell C. M. Efficient auctions of multiple objects. (1996) . Working paper, Department of Economics, Ohio State University Google Scholar
  • Cormen T. C. , Leiserson C. E. , Rivest R. L. Introduction to Algorithms (1990) (MIT Press, Cambridge, MA) Google Scholar
  • Edmonds J. Maximum matching and a polyhedron with 0,1 vertices. J. Res. Nat. Bur. Standards (1965) 69B 125 130 CrossrefGoogle Scholar
  • Federal Communications Commission (1993) . In the matter of implementation of section 309(j) of Communication Act, competitive bidding: Notice of proposed rule making. PP Docket No. 93-253, Released October 12 Google Scholar
  • Garey M. R. , Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco) Google Scholar
  • Harstad R. M. , Rothkopf M. H. Combinatorial auctions with synergies. (1995) . Working paper, RUTCOR, Rutgers University, New Brunswick, NJ Google Scholar
  • Karp R. M. , Miller R. E. , Thatcher J. W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85 103 CrossrefGoogle Scholar
  • Krishna V. , Rosenthal R. W. Simultaneous auctions with synergies. Games Econom. Behav. (1996) 17 1 31 CrossrefGoogle Scholar
  • Lawler E. L. Combinatorial Optimization: Networks and Matroids (1976) (Holt, Rinehart and Winston, New York) Google Scholar
  • Ledyard J. O. , Porter D. , Rangel J. Using computerized exchange systems to solve an allocation problem in project management. J. Organ. Comput (1994) 4 3 Google Scholar
  • McAfee R. P. Auction design for personal communications services. (1993) . PacTel Exhibit in PP Docket No. 93-253 Google Scholar
  • McCabe K. S. , Rassenti S. , Smith V. L. Smart computer assisted markets. Science (1991) 254 534 538 CrossrefGoogle Scholar
  • McCurdy R. C. Private communication. (1981) November 3 Google Scholar
  • McMillan J. Selling spectrum rights. J. Econom. Perspect. (1994) 8 145 162 CrossrefGoogle Scholar
  • Mercer A. , Tielin D. Competitive tendering strategies in the bus industry. J. Oper. Res. Soc. (1996) 47 1452 1460 CrossrefGoogle Scholar
  • Milgrom P. R. , Wilson R. B. (1993) . Affidavit of Paul R. Milgrom and Robert B. Wilson before the Federal Communications Commission, Docket No. 93-253, November 8 Google Scholar
  • Murty K. G. Network Programming (1992) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Papadimitriou C. H. Computational Complexity (1994) (Addison-Wesley, Reading MA) Google Scholar
  • Pulleyblank W. R. , Graham R. L. , Grötschel M. , Lovász L. Matchings and extensions. Handbook of Combinatorics (1995) 1. (MIT Press, Cambridge, MA) 179 232 Google Scholar
  • Rassenti S. J. , Smith V. L. , Bulfin R. L. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econom. (1982) 13 402 417 CrossrefGoogle Scholar
  • Rothkopf M. H. Bidding in simultaneous auctions with a constraint on exposure. Oper. Res. (1977) 25 620 629 LinkGoogle Scholar
  • Rothkopf M. H. , Engelbrecht-Wiggans R. , Shubik M. , Stark R. Bidding theory: The phenomena to be modeled. Auctions, Bidding and Contracting: Uses and Theory (1983) (New York University Press, New York) 105 120 Google Scholar
  • Rosenthal R. W. , Wang R. Simultaneous auctions with synergies and common values. Games Econom. Behav (1966) 17 32 55 CrossrefGoogle Scholar
  • Schackmann A. Private communication. (1989) Google Scholar
  • Schrijver A. Theory of Linear and Integer Programming (1986) (John Wiley & Sons, Chichester) Google Scholar
  • Smith S. A. , Rothkopf M. H. Simultaneous bidding with a fixed charge if any bid succeeds. Oper. Res (1985) 33 28 37 LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.