Abstract
In this paper, we present a preliminary idea about applying multi-unit combinatorial auctions to an electric power allocation problem when it includes sustainable power sources and it considers guaranteeing stable continuous use of the supplied power. Multi-unit combinatorial auction is a combinatorial auction that has some items that can be seen as indistinguishable. Theoretically, such mechanisms could be applied for dynamic electricity auctions. We try to illustrate how such a mechanism can be applied to the actual electric power allocation problem when we consider the situation that there are sustainable electric power sources and guaranteeing stable continuous use of them. An approximation mechanism has been applied for a large-scale auction problem to overcome its computational intractability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carrasco, J.M., Bialasiewicz, J.T., Guisado, R.C.P., Leon, J.I.: Power-electronic systems for the grid integration of renewable energy sources: A survey. IEEE Trans. Industrial Electronics 53(4), 1002–1016 (2006)
Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. The MIT Press (2006)
Fukuta, N., Ito, T.: Periodical resource allocation using approximated combinatorial auctions. In: Proc. of The 2007 WIC/IEEE/ACM International Conference on Intelligent Agent Technology (IAT 2007), pp. 434–441 (2007)
Fukuta, N., Ito, T.: Approximated winner determination for a series of combinatorial auctions. In: Proc. of 1st International Conference on Agents and Artificial Intelligence (ICAART 2009), pp. 400–407 (2009)
Fukuta, N.: Toward a VCG-like approximate mechanism for large-scale multi-unit combinatorial auctions. In: Proc. IEEE/ACM/WIC International Conference on Intelligent Agent Technology (IAT 2011), pp. 317–322 (2011)
Fukuta, N., Ito, T.: 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 (IAT 2006), pp. 618–621 (2006)
Fukuta, N., Ito, T.: Fine-grained efficient resource allocation using approximated combinatorial auctions–a parallel greedy winner approximation for large-scale problems. Web Intelligence and Agent Systems: An International Journal 7(1), 43–63 (2009)
Fukuta, N., Ito, T.: An experimental analysis of biased parallel greedy approximation for combinatorial auctions. International Journal of Intelligent Information and Database Systems 4(5), 487–508 (2010)
Fukuta, N., Ito, T.: Toward combinatorial auction-based better electric power allocation on sustainable electric power systems. In: Proc. International Workshop on Sustainable Enterprise Software (SES 2011), pp. 392–399 (2011)
Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proc. of the 17th National Conference on Artificial Intelligence (AAAI 2000), pp. 22–29 (2000)
Lehmann, D., O’Callaghan, L.I., Shoham, Y.: Truth revelation in rapid, approximately efficient combinatorial auctions. Journal of the ACM 49, 577–602 (2002)
Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proc. of ACM Conference on Electronic Commerce (EC 2000), pp. 66–76 (2000)
MacKay, J.: Sustainable Energy - Without Hot Air, UIT Cambridge (2009)
McMillan, J.: Selling spectrum rights. The Journal of Economic Perspectives (1994)
Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. In: Proc. of ACM Conference on Electronic Commerce, pp. 242–252 (2000), citeseer.ist.psu.edu/nisan00computationally.html
Parkes, D.C., Cavallo, R., Elprin, N., Juda, A., Lahaie, S., Lubin, B., Michael, L., Shneidman, J., Sultan, H.: Ice: An iterative combinatorial exchange. In: The Proc. 6th ACM Conf. on Electronic Commerce (EC 2005) (2005)
Ramchurn, S.D., Vytelingum, P., Rogers, A., Jennings, N.: Agent-based control for decentralized demand side management in the smart grid. In: Proc. 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 5–12 (2011)
Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Cabob: A fast optimal algorithm for winner determination in combinatorial auctions. Management Science 51(3), 374–390 (2005)
Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: Proc. of the Third ACM Conference on Electronic Commerce (EC 2001), pp. 125–136 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fukuta, N., Ito, T. (2012). An Approach to Sustainable Electric Power Allocation Using a Multi-round Multi-unit Combinatorial Auction. In: Cranefield, S., Song, I. (eds) Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing. PRIMA 2011. Lecture Notes in Computer Science(), vol 7580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35612-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-35612-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35611-7
Online ISBN: 978-3-642-35612-4
eBook Packages: Computer ScienceComputer Science (R0)