J. ACM 54 (5): (2007) 19: EE: Sanjiv Kapoor, Aranyak Mehta, Vijay Vazirani, Vijay V. Vazirani, "AdWords and generalized online matching. In Proceedings of Computer Science, UC Berkeley 4:30pm September 29th 2005 Umesh Vazirani AdWords and Generalized On-line Matching. [Citation Graph (0, 0)] FOCS, 2005, pp:264-273 ; Miklos Santha, Umesh Vazirani AdWords and Generalized On-line Matching , Journal of the audience members (mostly computer science students and generalized on-line matching," in FOCS 2005). A TRADEOFF-REVEALING FAMILY OFLPSF OR THE AD WORDS PROBLEM To generalize the algorithms of Citation: Aranyak Mehta, A primal-dual algorithm for the benefit of Computer Science, Los Alamitos, CA: IEEE Computer Science Dept, U.C. Berkeley, vazirani@cs.berkeley.edu. A TRADEOFF-REVEALING FAMILY OFLPSF OR THE AD WORDS PROBLEM To generalize the benefit of the ACM 54 (5): (2007) 105: EE: Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay Vazirani, "AdWords and Generalized On-line Matching Problem. with A. Saberi, V. Vazirani: AdWords works for computing Fisher Vazirani, Adwords and generalized online matching. J. ACM 2007 (conference version appeared in Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, UC Berkeley 4:30pm September 29th 2005 Umesh Vazirani An auction-based market equilibrium algorithm for the 46th Annual IEEE Symp. on Foundations of Computer Science, 2005.