Computationally manageable combinational auctions

Management Science

Volumn 44, Issue 8, 1998, Pages 1131-1147

  Rothkopf, Michael H ^a   Pekeč, Aleksandar ^a   Harstad, Ronald M ^a  

^a NONE

Author keywords

Bidding with Synergies; Combinatorial Auctions; Computational Complexity; Multi Item simultaneous Auctions; Spectrum Auctions

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

COMBINATORIAL AUCTIONS; MULTI-ITEM SIMULTANEOUS AUCTIONS; SPECTRUM AUCTIONS;

COMMERCE;

EID: 0032141895     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.8.1131     Document Type: Article

References (33)

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