Journal of Engineering and Applied Sciences

Year: 2017
Volume: 12
Issue: 12
Page No. 3174 - 3177

Storage, Processing and Distribution of Information and Communication: Cloud Computing in Latin-American

Authors : AmelecViloria

References

Angel, E., E. Bampis and F. Pascual, 2006. Truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci., 369: 157-168.
Direct Link  |  

Awerbuch, B., Y. Azar and A. Meyerson, 2003. Reducing truth-telling online mechanisms to online optimization. Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 09-11, 2003, ACM, San Diego, California, ISBN:1-58113-674-9, pp: 503-510.

Bar, Y.Z., K. Hildrum and F. Wu, 2002. Incentive-compatible online auctions for digital goods. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, January 06-08, 2002, ACM, San Francisco, California, ISBN:0-89871-513-X, pp: 964-970.

Baumol, W.J., 1972. On taxation and the control of externalities. Am. Econ. Rev., 62: 307-322.
Direct Link  |  

Buyya, R., C.S. Yeo and S. Venugopal, 2008. Market-Oriented cloud computing: Vision, Hype and reality for delivering IT services as computing utilities. Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications, September 26-28, 2008, Houston, USA., pp: 5-13.

Che, Y.K. and J. Kim, 2009. Optimal collusion-proof auctions. J. Econ. Theory, 144: 565-603.
Direct Link  |  

Deek, L., X. Zhou, K. Almeroth and H. Zheng, 2011. To preempt or not: Tackling bid and time-based cheating in online spectrum auctions. Proceedings of the 2011 IEEE International Conference on INFOCOM, April 10-15, 2011, IEEE, Santa Barbara, California, ISBN:978-1-4244-9919-9, pp: 2219-2227.

Hajiaghayi, M.T., 2005. Online auctions with re-usable goods. Proceedings of the 6th ACM Conference on Electronic Commerce, June 05-08, 2005, ACM, Vancouver, British Columbia, Canada, ISBN:1-59593-049-3, pp: 165-174.

Hajiaghayi, M.T., R. Kleinberg and D.C. Parkes, 2004. Adaptive limited-supply online auctions. Proceedings of the 5th ACM Conference on Electronic Commerce, May 17-20, 2004, ACM, New York, USA., ISBN:1-58113-771-0, pp: 71-80.

Klemperer, P., 2002. What really matters in auction design. J. Econ. Perspect., 16: 169-189.
Direct Link  |  

Lavi, R. and N. Nisan, 2005. Online ascending auctions for gradually expiring items. Proceedings of the 16th Annual ACM-SIAM Symposium On Discrete Algorithms, January 23-25, 2005, ACM, Vancouver, British Columbia, ISBN:0-89871-585-7, pp: 1146-1155.

Lavi, R. and N. Nisan, 2014. Competitive analysis of incentive compatible on-line auctions. Theor. Comput. Sci., 310: 159-180.
CrossRef  |  Direct Link  |  

Nisan, N.T., E.T. Roughgarden and V. Vazirani, 2016. Algorithmic Game Theory. Cambridge University Press, Cambridge, England,.

Yaniv, E.R., A. Fiat, R. Karp and G. Turpin, 1992. Competitive analysis of financial games. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science 1992, October 24-27, 1992, IEEE, Ontario, Canada, ISBN:0-8186-2900-2, pp: 327-333.

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved