APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS

Naoki Fukuta, Takayuki Ito

Abstract

In this paper, we propose approximated winner determination algorithms for iteratively conducted combinatorial auctions. Our algorithms are designed to effectively reuse last-cycle solutions to speed up the initial approximation performance on the next cycle. Experimental results show that our proposed algorithms outperform existing algorithms when a large number of similar bids are contained through iterations. Also, we propose an enhanced algorithm that effectively avoids the undesirable reuse of the last solutions in the algorithm without serious computational overheads.

References

  1. Andrew, L. L., Hanly, S. V., and Mukhtar, R. G. (2008). Active queue management for fair resource allocation in wireless networks. IEEE Transactions on Mobile Computing, pages 231-246.
  2. Cramton, P., Shoham, Y., and Steinberg, R. (2006). Combinatorial Auctions. The MIT Press.
  3. de Vries, S. and Vohra, R. V. (2003). Combinatorial auctions: A survey. International Transactions in Operational Research, 15(3):284-309.
  4. Dobzinski, S. and Schapira, M. (2006). An improved approximation algorithm for combinatorial auctions with submodular bidders. In Proc. of the seventeenth annual ACM-SIAM symposium on Discrete algorithm(SODA2006), pages 1064-1073. ACM Press.
  5. Fujishima, Y., Leyton-Brown, K., and Shoham, Y. (1999). Taming the computational complexity of combinatorial auctions: Optimal and approximate approarches. In Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI1999), pages 548-553.
  6. Fukuta, N. and Ito, T. (2006). Towards better approximation of winner determination for combinatorial auctions with large number of bids. In Proc. of The 2006 WIC/IEEE/ACM International Conference on Intelligent Agent Technology(IAT2006), pages 618-621.
  7. Fukuta, N. and Ito, T. (2007a). Periodical resource allocation using approximated combinatorial auctions. In Proc. of The 2007 WIC/IEEE/ACM International Conference on Intelligent Agent Technology(IAT2007), pages 434-441.
  8. Fukuta, N. and Ito, T. (2007b). Short-time approximation on combinatorial auctions - a comparison on approximated winner determination algorithms. In Proc. of The 3rd International Workshop on Data Engineering Issues in E-Commerce and Services(DEECS2007), pages 42-55.
  9. Guo, Y., Lim, A., Rodrigues, B., and Zhu, Y. (2005). A non-exact approach and experiment studies on the combinatorial auction problem. In Proc. of the 38th Hawaii International Conference on System Sciences(HICSS2005), page 82.1.
  10. Hoos, H. H. and Boutilier, C. (2000). Solving combinatorial auctions using stochastic local search. In Proc. of the Proc. of 17th National Conference on Artificial Intelligence (AAAI2000), pages 22-29.
  11. Lavi, R. and Swamy, C. (2005). Truthful and near-optimal mechanism design via linear programming. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS2005), pages 595-604.
  12. Lehmann, D., O'Callaghan, L. I., and Shoham, Y. (2002). Truth revelation in rapid, approximately efficient combinatorial auctions. Journal of the ACM, 49:577-602.
  13. Leyton-Brown, K., Pearson, M., and Shoham, Y. (2000). Towards a universal test suite for combinatorial auction algorithms. In Proc. of ACM Conference on Electronic Commerce (EC2000), pages 66-76.
  14. McMillan, J. (1994). Selling spectrum rights. The Journal of Economic Perspectives.
  15. Sandholm, T. (2007). Expressive commerce and its application to sourcing: How we conducted $35 billion of generalized combinatorial auctions. AI Magazine, 28(3):45-58.
  16. Sandholm, T., Suri, S., Gilpin, A., and Levine, D. (2005). Cabob: A fast optimal algorithm for winner determination in combinatorial auctions. Management Science, 51(3):374-390.
  17. Thomadakis, M. E. and Liu, J.-C. (1999). On the efficient scheduling of non-periodic tasks in hard real-time systems. In Proc. of IEEE Real-Time Systems Symp., pages 148-151.
  18. Xiao, L., Chen, S., and Zhang, X. (2004). Adaptive memory allocations in clusters to handle unexpectedly large data-intensive jobs. IEEE Transactions on Parallel and Distributed Systems, 15(7):577-592.
  19. Xie, T. and Qin, X. (2008). Security-aware resource allocation for real-time parallel jobs on homogeneous and heterogeneous clusters. IEEE Transactions on Parallel and Distributed Systems, 19(5):682-697.
  20. Zurel, E. and Nisan, N. (2001). An efficient approximate allocation algorithm for combinatorial auctions. In Proc. of the Third ACM Conference on Electronic Commerce (EC2001), pages 125-136.
Download


Paper Citation


in Harvard Style

Fukuta N. and Ito T. (2009). APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8111-66-1, pages 400-407. DOI: 10.5220/0001659104000407


in Bibtex Style

@conference{icaart09,
author={Naoki Fukuta and Takayuki Ito},
title={APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2009},
pages={400-407},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001659104000407},
isbn={978-989-8111-66-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS
SN - 978-989-8111-66-1
AU - Fukuta N.
AU - Ito T.
PY - 2009
SP - 400
EP - 407
DO - 10.5220/0001659104000407