메뉴 건너뛰기




Volumn 43, Issue 1, 2007, Pages 211-228

Simulating combinatorial auctions with dominance requirement and loll bids through automated agents

Author keywords

Auction rules; Combinatorial auctions; Multi agent systems; Simulation

Indexed keywords

AUTONOMOUS AGENTS; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; INDUSTRIAL ECONOMICS; MULTI AGENT SYSTEMS;

EID: 33846033573     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dss.2006.09.008     Document Type: Article
Times cited : (13)

References (37)
  • 1
    • 0005289278 scopus 로고    scopus 로고
    • An Efficient Ascending Bid Auction for Multiple Objects
    • Department of Economics, University of Maryland
    • Ausubel L. An Efficient Ascending Bid Auction for Multiple Objects. Working Paper vol. 97-06 (1997), Department of Economics, University of Maryland
    • (1997) Working Paper , vol.97-06
    • Ausubel, L.1
  • 3
    • 0024625337 scopus 로고
    • Allocating uncertain and unresponsive resources: an experimental approach
    • Banks J.S., Ledyard J.O., and Porter D.P. Allocating uncertain and unresponsive resources: an experimental approach. Rand Journal of Economics 20 (1989) 1-25
    • (1989) Rand Journal of Economics , vol.20 , pp. 1-25
    • Banks, J.S.1    Ledyard, J.O.2    Porter, D.P.3
  • 5
    • 21444435260 scopus 로고    scopus 로고
    • A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of right to use railroad tracks
    • Brewer P.J., and Plott C.R. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of right to use railroad tracks. International Journal of Industrial Organization 14 (1996) 857-886
    • (1996) International Journal of Industrial Organization , vol.14 , pp. 857-886
    • Brewer, P.J.1    Plott, C.R.2
  • 7
    • 33846117616 scopus 로고    scopus 로고
    • Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments
    • Computer Science Department, Carnegie Mellon University, USA
    • Conitzer V., and Sandholm T. Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments. Technical Report (2004), Computer Science Department, Carnegie Mellon University, USA
    • (2004) Technical Report
    • Conitzer, V.1    Sandholm, T.2
  • 9
    • 0038319437 scopus 로고    scopus 로고
    • Spectrum auctions
    • Cave M., Majumdar S., and Vogelsang I. (Eds), Elsevier Science B.V., Amsterdam Chapter 14
    • Cramton P. Spectrum auctions. In: Cave M., Majumdar S., and Vogelsang I. (Eds). Handbook of Telecommunications Economics (2002), Elsevier Science B.V., Amsterdam 605-639 Chapter 14
    • (2002) Handbook of Telecommunications Economics , pp. 605-639
    • Cramton, P.1
  • 10
    • 0004266933 scopus 로고    scopus 로고
    • Combinatorial Auctions: a Survey
    • Northwestern University
    • De Vries S., and Vohra R. Combinatorial Auctions: a Survey. Discussion Paper vol. 1296 (2000), Northwestern University
    • (2000) Discussion Paper , vol.1296
    • De Vries, S.1    Vohra, R.2
  • 11
    • 0003873211 scopus 로고    scopus 로고
    • A New and Improved Design for Multi-object Iterative Auctions
    • California Institute of Technology
    • DeMartini C., Kwasnica A.M., Ledyard J.O., and Porter D. A New and Improved Design for Multi-object Iterative Auctions. Technical Report SSWP vol. 1054 (1999), California Institute of Technology
    • (1999) Technical Report SSWP , vol.1054
    • DeMartini, C.1    Kwasnica, A.M.2    Ledyard, J.O.3    Porter, D.4
  • 13
    • 84880681390 scopus 로고    scopus 로고
    • Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
    • Fujishima Y., Leyton-Brown K., and Shoham Y. Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. Proceedings of IJCAI'99 (1999)
    • (1999) Proceedings of IJCAI'99
    • Fujishima, Y.1    Leyton-Brown, K.2    Shoham, Y.3
  • 17
    • 0036885508 scopus 로고    scopus 로고
    • Combinatorial auctions using rule-based bids
    • Jones J.L., and Koehler G.J. Combinatorial auctions using rule-based bids. Decision Support Systems 34 (2002) 59-74
    • (2002) Decision Support Systems , vol.34 , pp. 59-74
    • Jones, J.L.1    Koehler, G.J.2
  • 18
    • 0033728203 scopus 로고    scopus 로고
    • A combinatorial auction with multiple winners for universal service
    • Kelly F., and Steinberg R. A combinatorial auction with multiple winners for universal service. Management Science 46 (2000) 586-596
    • (2000) Management Science , vol.46 , pp. 586-596
    • Kelly, F.1    Steinberg, R.2
  • 19
    • 0032804976 scopus 로고    scopus 로고
    • Auction theory: a guide to the literature
    • Klemperer P. Auction theory: a guide to the literature. Journal of Economic Surveys 13 3 (1999) 227-286
    • (1999) Journal of Economic Surveys , vol.13 , Issue.3 , pp. 227-286
    • Klemperer, P.1
  • 20
    • 33846082836 scopus 로고    scopus 로고
    • V. Krishna, Auction Theory. Academic Press, Elsevier Science (2002), USA.
  • 21
    • 0033184840 scopus 로고    scopus 로고
    • On combinatorial auction and Lagrangean relaxation for distributed resource scheduling
    • Kutanoglu E., and Wu D.S. On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Transactions 31 9 (1999) 813-826
    • (1999) IIE Transactions , vol.31 , Issue.9 , pp. 813-826
    • Kutanoglu, E.1    Wu, D.S.2
  • 26
    • 33750241333 scopus 로고    scopus 로고
    • Developing adaptive auction mechanisms
    • Pardoe D., and Stone P. Developing adaptive auction mechanisms. ACM SIGecom Exchanges 5 3 (2005) 1-10
    • (2005) ACM SIGecom Exchanges , vol.5 , Issue.3 , pp. 1-10
    • Pardoe, D.1    Stone, P.2
  • 30
    • 30044444898 scopus 로고    scopus 로고
    • An ascending-price generalized Vickrey auction
    • Harvard University
    • Parkes D.C., and Ungar L.H. An ascending-price generalized Vickrey auction. Technical Report (2002), Harvard University
    • (2002) Technical Report
    • Parkes, D.C.1    Ungar, L.H.2
  • 31
    • 33751578994 scopus 로고
    • A combinational auction mechanism for airport time slot allocation
    • Rassenti S.J., Smith V.L., and Bulfin R.L. A combinational auction mechanism for airport time slot allocation. Bell Journal of Economics 13 (1982) 402-417
    • (1982) Bell Journal of Economics , vol.13 , pp. 402-417
    • Rassenti, S.J.1    Smith, V.L.2    Bulfin, R.L.3
  • 33
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinational auctions
    • Rothkopf M.H., Pekec A., and Harstad M.H. Computationally manageable combinational auctions. Management Science 44 8 (1998) 1131-1147
    • (1998) Management Science , vol.44 , Issue.8 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, M.H.3
  • 34
    • 0033901115 scopus 로고    scopus 로고
    • Approaches to winner determination in combinatorial auctions
    • Sandholm T. Approaches to winner determination in combinatorial auctions. Decision Support Systems 28 (2000) 165-176
    • (2000) Decision Support Systems , vol.28 , pp. 165-176
    • Sandholm, T.1
  • 37
    • 0004115521 scopus 로고
    • Generalized Vickrey auctions
    • University of Michigan
    • Varian H., and MacKie-Mason J.K. Generalized Vickrey auctions. Technical Report (1995), University of Michigan
    • (1995) Technical Report
    • Varian, H.1    MacKie-Mason, J.K.2


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