Voir la notice de l'article provenant de la source Math-Net.Ru
@article{SJIM_2011_14_3_a12, author = {A. B. Khutoretskiǐ and S. V. Bredikhin and A. S. Belov}, title = {An effective balanced budget and a~$d$-nonmanipulable technique for processor time allocation}, journal = {Sibirskij \v{z}urnal industrialʹnoj matematiki}, pages = {125--131}, publisher = {mathdoc}, volume = {14}, number = {3}, year = {2011}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/SJIM_2011_14_3_a12/} }
TY - JOUR AU - A. B. Khutoretskiǐ AU - S. V. Bredikhin AU - A. S. Belov TI - An effective balanced budget and a~$d$-nonmanipulable technique for processor time allocation JO - Sibirskij žurnal industrialʹnoj matematiki PY - 2011 SP - 125 EP - 131 VL - 14 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/SJIM_2011_14_3_a12/ LA - ru ID - SJIM_2011_14_3_a12 ER -
%0 Journal Article %A A. B. Khutoretskiǐ %A S. V. Bredikhin %A A. S. Belov %T An effective balanced budget and a~$d$-nonmanipulable technique for processor time allocation %J Sibirskij žurnal industrialʹnoj matematiki %D 2011 %P 125-131 %V 14 %N 3 %I mathdoc %U http://geodesic.mathdoc.fr/item/SJIM_2011_14_3_a12/ %G ru %F SJIM_2011_14_3_a12
A. B. Khutoretskiǐ; S. V. Bredikhin; A. S. Belov. An effective balanced budget and a~$d$-nonmanipulable technique for processor time allocation. Sibirskij žurnal industrialʹnoj matematiki, Tome 14 (2011) no. 3, pp. 125-131. http://geodesic.mathdoc.fr/item/SJIM_2011_14_3_a12/
[1] Broberg J., Venugopal S., Buyya R., “Market-oriented grids and utility computing: The stateof-the-art and future directions”, J. Grid Computing, 2008, no. 6, 255–276 | DOI
[2] Schnizler B., “Auction-based resource allocation”, Market Oriented Grid and Utility Computing, Wiley, Hoboken, 2009
[3] Parkes D. C., Kalagnanam J., Eso M., “Achieving budget-balance with Vickrey-based payment schemes in exchanges”, Proc. 17 Internat. Joint Conf. on Artificial Intelligence (IJCAI-01), Morgan Kaufmann Publ., San Francisco, 2001, 1161–1168
[4] Myerson R. B., Satterthwaite M. A., “Efficient mechanisms for bilateral trading”, J. Economic Theory, 29 (1983), 265–281 | DOI | MR
[5] Wolski R., Plank J., Brevik J., Bryan T., “Analyzing market-based resource allocation strategies for the computational grid”, Internat. J. High Performance Computing Applications, 15:3 (2001), 258–281 | DOI
[6] Bredikhin S. V., Khutoretskii A. B., “Ravnovesnye raspredeleniya protsessornogo vremeni pri lineinykh funktsiyakh poleznosti”, Sib. zhurn. industr. matematiki, 13:2(42) (2010), 46–53 | Zbl
[7] Lazar A., Semret N., Auctions for network resource sharing, CTR Tech. Report: CU/CTR/TR 468-97-02, Center for Telecommunications Research, Columbia Univ., 1997
[8] Khutoretskii A. B., Bredikhin S. V., Goldobin I. A., “Raspredelenie protsessornogo vremeni posredstvom posledovatelnogo auktsiona vtoroi tseny pri nedelimykh sprosakh”, Parallelnye vychislitelnye tekhnologii, (PaVT'2008), Tr. Mezhdunar. nauch. konf. (Sankt-Peterburg, 28 yanvarya–1 fevralya 2008 g.), Izd. YuUrGU, Chelyabinsk, 2008, Elektronnyi resurs (1 CD)
[9] Regev O., Nisan N., “The POPCORN market: Online markets for computational resources”, Decision Support Systems, 28:1–2 (2000), 177–189 | DOI | MR
[10] Varian Hal R., Economic mechanism design for computerized agents, Proc. Usenix Workshop on Electronic Commerce, N.Y., 1995