SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Artificial Intelligence

Volumn 135, Issue 1-2, 2002, Pages 1-54

Algorithm for optimal winner determination in combinatorial auctions

(1) Sandholm, Tuomas a

a Carnegie Mellon University ^* (United States)

Author keywords

Auction; Bidding with synergies; Combinatorial auction; Multi item auction; Multi object auction; Multiagent systems; Winner determination

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; DYNAMIC PROGRAMMING;

COMBINATORIAL AUCTIONS;

COMBINATORIAL MATHEMATICS;

EID: 0036467861 PISSN: 00043702 EISSN: None Source Type: Journal
DOI: 10.1016/S0004-3702(01)00159-X Document Type: Article

Times cited : (662)

References (63)

1
- 0012606550
- Leveled commitment contracting among myopic individually rational agents
- Paris, France
- (1998) Proc. Third International Conference on Multi-Agent Systems (ICMAS) , pp. 26-33
- Andersson, M.R.¹ Sandholm, T.²

2
- 0032596658
- Time-quality tradeoffs in reallocative negotiation with combinatorial contract types
- Orlando, FL
- (1999) Proc. AAAI-99 , pp. 3-10
- Andersson, M.R.¹ Sandholm, T.²

3
- 0033702827
- Contract type sequencing for reallocative negotiation
- Taipei, Taiwan
- (2000) Proc. Twentieth International Conference on Distributed Computing Systems
- Andersson, M.¹ Sandholm, T.²

4
- 0000658820
- Leveled commitment contracts with myopic and strategic agents
- early version appeared in: Proc. AAAI-98, Madison, WI, 1998, pp. 38-45
- (2001) J. Economic Dynamics and Control (Special Issue on Agent-Based Computational Economics.) , vol.25 , pp. 615-640
- Andersson, M.R.¹ Sandholm, T.²

5
- 84880660522
- Sequential auctions for the allocation of resources with complementarities
- Stockholm, Sweden
- (1999) Proc. IJCAI-99 , pp. 527-534
- Boutilier, C.¹ Goldszmidt, M.² Sabata, B.³

6
- 0032762033
- Greedy local search and weighted set packing approximation
- Baltimore, MD
- (1999) Proc. 10th Annual SIAM-ACM Symposium on Discrete Algorithms (SODA) , pp. 169-176
- Chandra, B.¹ Halldórsson, M.M.²

7
- 34250446073
- Multipart pricing of public goods
- (1971) Public Choice , vol.11 , pp. 17-33
- Clarke, E.H.¹

8
- 0004258018
- D. Reidel, Dordrecht
- (1974) Advanced Combinatorics
- Comtet, L.¹

9
- 0008138296
- Minimal preference elicitation in combinatorial auctions
- Seattle, WA
- (2001) Proc. IJCAI-2001 Workshop on Economic Agents, Models, and Mechanisms , pp. 71-80
- Conen, W.¹ Sandholm, T.²

10
- 0242624746
- Preference elicitation in combinatorial auctions: Extended abstract
- Tampa, FL
- (2001) Proc. ACM Conference on Electronic Commerce (ACM-EC)
- Conen, W.¹ Sandholm, T.²

11
- 0004054088
- Wiley, New York
- (1998) Combinatorial Optimization
- Cook, W.J.¹ Cunningham, W.H.² Pulleyblank, W.R.³ Schrijver, A.⁴

12
- 0004116989
- MIT Press, Cambridge, MA
- (1990) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³

13
- 0004266933
- Draft, August 28th
- (2000) Combinatorial auctions: A survey
- De Vries, S.¹ Vohra, R.²

14
- 0003873211
- Technical Report 1054, California Institute of Technology, Social Science
- (1998) A new and improved design for multi-object iterative auctions
- DeMartini, C.¹ Kwasnica, A.² Ledyard, J.³ Porter, D.⁴

15
- 84880681390
- Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
- Stockholm, Sweden
- (1999) Proc. IJCAI-99 , pp. 548-553
- Fujishima, Y.¹ Leyton-Brown, K.² Shoham, Y.³

16
- 0001619835
- The set partitioning problem: Set covering with equality constraints
- (1969) Oper. Res. , vol.17 , Issue.5 , pp. 848-856
- Garfinkel, R.¹ Nemhauser, G.²

17
- 0001314984
- Incentives in teams
- (1973) Econometrica , vol.41 , pp. 617-631
- Groves, T.¹

18
- 84958967409
- Approximations of independent sets in graphs
- K. Jansen, J. Rolim (Eds.), The First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Aalborg, Denmark, Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1444 , pp. 1-14
- Halldórsson, M.M.¹

19
- 0002010884
- Approximations of weighted independent set and hereditary subset problems
- Computing and Combinatorics; early versions appeared in: Computing and Combinatorics, Proceedings of the 5th Annual International Conference (COCOON), Tokyo, Japan 1999
- (2000) J. Graph Algorithms Appl. , vol.4 , Issue.1 , pp. 1-16
- Halldórsson, M.M.¹

20
- 84887505844
- Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1627 , pp. 261-270

21
- 0008040962
- Independent sets with domination constraints
- (1998) Discrete Appl. Math.
- Halldórsson, M.M.¹ Kratochvíl, J.² Telle, J.A.³

22
- 0008052514
- Proceedings of the 25th International Conference on Automata, Languages, and Programming (ICALP), Aalborg, Denmark, July
- (1998) Springer Lecture Notes in Computer Science , vol.1443

23
- 0002552419
- Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and 3-coloring
- (1997) J. Graph Algorithm Appl. , vol.1 , Issue.3 , pp. 1-13
- Halldórsson, M.M.¹ Lau, H.C.²

24
- 0000109157
- 1-ε
- (1999) Acta Mathematica , vol.182 , pp. 105-142
- Håstad, J.¹

25
- 0000151066
- Multi-object auctions: Sequential vs. simultaneous sales
- (1986) Management Sci. , vol.32 , pp. 1599-1610
- Hausch, D.B.¹

26
- 0020822226
- Efficient bounds for the stable set, vertex cover, and set packing problems
- (1983) Discrete Appl. Math. , vol.6 , pp. 243-254
- Hochbaum, D.S.¹

27
- 0003777592
- PWS Publishing Company, Boston, MA
- (1997) Approximation Algorithms for NP-hard Problems
- Hochbaum, D.S.¹

28
- 0003037529
- Reducibility among combinatorial problems
- R.E. Miller, J.W. Thatcher, (Eds.), Plenum Press, New York
- (1972) Complexity of Computer Computations , pp. 85-103
- Karp, R.M.¹

29
- 0033728203
- A combinatorial auction with multiple winners for universal services
- (2000) Management Sci. , vol.46 , Issue.4 , pp. 586-596
- Kelly, F.¹ Steinberg, R.²

30
- 0022129301
- Depth-first iterative-deepening: An optimal admissible tree search
- (1985) Artificial Intelligence , vol.27 , Issue.1 , pp. 97-109
- Korf, R.E.¹

31
- 0002548160
- Computationally limited agents in auctions
- Montreal, Canada
- (2001) Proc. AGENTS-01 Workshop of Agents for B2B , pp. 27-34
- Larson, K.¹ Sandholm, T.²

32
- 0001770141
- Costly valuation computation in auctions: Deliberation equilibrium
- Siena, Italy
- (2001) Proc. Theoretical Aspects of Reasoning about Knowledge (TARK) , pp. 169-182
- Larson, K.¹ Sandholm, T.²

33
- 0008044404
- Austin, TX
- (1998) Personal communications at the National Science Foundation Workshop on Research Priorities in Electronic Commerce
- Ledyard, J.¹

34
- 0010248861
- Truth revelation in rapid, approximately efficient combinatorial auctions
- Denver, CO
- (1999) Proc. ACM Conference on Electronic Commerce (ACM-EC) , pp. 96-102
- Lehmann, D.¹ O'Callaghan, L.I.² Shoham, Y.³

35
- 0020635569
- An algorithm for the maximum internally stable set in a weighted graph
- (1983) Internat. J. Comput. Math. , vol.13 , pp. 117-129
- Loukakis, E.¹ Tsouros, C.²

36
- 0000793916
- Analyzing the airwaves auction
- (1996) J. Economic Perspectives , vol.10 , Issue.1 , pp. 159-175
- Preston McAfee, R.¹ McMillan, J.²

37
- 0001397828
- Selling spectrum rights
- (1994) J. Economic Perspectives , vol.8 , Issue.3 , pp. 145-162
- McMillan, J.¹

38
- 0344009181
- Technical Report, Stanford University, Department of Economics Revised 4/21/1999
- (1997) Putting auction theory to work: The simultaneous ascending auction
- Milgrom, P.¹

39
- 85134055970
- Bidding and allocation in combinatorial auctions
- Minneapolis, MN
- (2000) Proc. ACM Conference on Electronic Commerce (ACM-EC) , pp. 1-12
- Nisan, N.¹

40
- 0003897694
- Addison-Wesley, Reading, MA
- (1995) Computational Complexity
- Papadimitriou, C.H.¹

41
- 0008141737
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- (1991) Internat. J. Comput. Math. , vol.38 , pp. 163-175
- Pardalos, P.M.¹ Desai, N.²

42
- 0000594032
- A combinatorial auction mechanism for airport time slot allocation
- (1982) Bell J. Econom. , vol.13 , pp. 402-417
- Rassenti, S.J.¹ Smith, V.L.² Bulfin, R.L.³

43
- 0000988669
- AIDA* - Asynchronous parallel IDA*
- Banff, Alberta
- (1994) Proc. 10th Canadian Conf. on AI , pp. 295-302
- Reinefeld, A.¹ Schnecke, V.²

44
- 0032141895
- Computationally manageable combinatorial auctions
- (1998) Management Sci. , vol.44 , Issue.8 , pp. 1131-1147
- Rothkopf, M.H.¹ Pekeč, A.² Harstad, R.M.³

45
- 0008086640
- A strategy for decreasing the total transportation costs among area-distributed transportation centers
- Turku School of Economics, Finland
- (1991) Nordic Operations Analysis in Cooperation (NOAS): OR in Business
- Sandholm, T.¹

46
- 0027708201
- An implementation of the contract net protocol based on marginal cost calculations
- Washington, DC
- (1993) Proc. AAAI-93 , pp. 256-262
- Sandholm, T.¹

47
- 0003411337
- Ph.D. Thesis, University of Massachusetts, Amherst, MA
- (1996) Negotiation among self-interested computationally limited agents
- Sandholm, T.¹

48
- 0002431467
- Contract types for satisficing task allocation, I: Theoretical results
- Stanford University, CA
- (1998) Proc. AAAI Spring Symposium Series: Satisficing Models , pp. 68-75
- Sandholm, T.¹

49
- 0033700004
- eMediator: A next generation electronic commerce server
- Barcelona, Spain, early version appeared in: Proc. AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, July 1999, pp. 46-55, and as: Washington University, St. Louis, Dept. of Computer Science Technical Report WU-CS-99-02, January 1999
- (2000) Proc. Fourth International Conference on Autonomous Agents (AGENTS) , pp. 73-96
- Sandholm, T.¹

50
- 0000962286
- Issues in computational Vickrey auctions
- Special Issue on Applying Intelligent Agents for Electronic Commerce. A short, early version appeared at the Second International Conference on Multi-Agent Systems (ICMAS), 1996, pp. 299-306
- (2000) Internat. J. Electronic Commerce , vol.4 , Issue.3 , pp. 107-129
- Sandholm, T.¹

51
- 0033165014
- Coalition structure generation with worst case guarantees
- early version appeared in: Proc. AAAI-98, Madison, WI, 1998, pp. 46-53
- (1999) Artificial Intelligence , vol.111 , Issue.1-2 , pp. 209-238
- Sandholm, T.¹ Larson, K.S.² Andersson, M.R.³ Shehory, O.⁴ Tohmé, F.⁵

52
- 0003101953
- Issues in automated negotiation and electronic commerce: Extending the contract net framework
- San Francisco, CA, Reprinted in: M.N. Huhns and M.P. Singh (Eds.), Readings in Agents, Morgan Kaufmann, San Mateo, CA, 1997, pp. 66-73
- (1995) Proc. First International Conference on Multi-Agent Systems (ICMAS) , pp. 328-335
- Sandholm, T.¹ Lesser, V.R.²

53
- 0347748154
- Leveled commitment contracts and strategic breach
- Short early version appeared as 'Advantages of a Leveled Commitment Contracting Protocol' in: Proc. AAAI-96, Portland, OR, 1996, pp. 126-133. Extended version: University of Massachusetts at Amherst, Computer Science Department, Technical Report 95-72
- (2001) Games and Economic Behavior (Special issue on AI and Economics) , vol.35 , pp. 212-270
- Sandholm, T.¹ Lesser, V.R.²

54
- 84880672871
- Algorithms for optimizing leveled commitment contracts
- Stockholm, Sweden, Extended version: Washington University, Department of Computer Science, Technical Report WUCS-99-04
- (1999) Proc. IJCAI-99 , pp. 535-540
- Sandholm, T.¹ Sikka, S.² Norden, S.³

55
- 84978059461
- Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
- Austin, TX
- (2000) Proc. AAAI-00 , pp. 90-97
- Sandholm, T.¹ Suri, S.²

56
- 84880914935
- Market clearability
- Seattle, WA
- (2001) Proc. IJCAI-01 , pp. 1145-1151
- Sandholm, T.¹ Suri, S.²

57
- 0003007251
- Side constraints and non-price attributes in markets
- Seattle, WA
- (2001) Proc. IJCAI-2001 Workshop on Distributed Constraint Reasoning , pp. 55-61
- Sandholm, T.¹ Suri, S.²

58
- 84880855418
- CABOB: A fast optimal algorithm for combinatorial auctions
- Seattle, WA
- (2001) Proc. IJCAI-01 , pp. 1102-1108
- Sandholm, T.¹ Suri, S.² Gilpin, A.³ Levine, D.⁴

59
- 29144448531
- Winner determination in combinatorial auction generalizations
- Montreal, Canada
- (2001) Proc. AGENTS-01 Workshop on Agent-Based Approaches to B2B , pp. 35-41
- Sandholm, T.¹ Suri, S.² Gilpin, A.³ Levine, D.⁴

60
- 84980096808
- Counterspeculation, auctions, and competitive sealed tenders
- (1961) J. Finance , vol.16 , pp. 8-37
- Vickrey, W.¹

61
- 24244475535
- Federal Communications Commission, September
- (1998) Wireless telecommunications action , vol.WT 98-35

62
- 0004180332
- Wiley, New York
- (1998) Integer Programming
- Wolsey, L.A.¹

63
- 0031703223
- The Michigan Internet AuctionBot: A configurable auction server for human and software agents
- Minneapolis/St. Paul, MN
- (1998) Proc. Second International Conference on Autonomous Agents (AGENTS) , pp. 301-308
- Wurman, P.R.¹ Wellman, M.P.² Walsh, W.E.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.