mangesh's library 36 articles Export

	Maximizing the spread of influence through a social network [My Copy] (2003) by D. Kempe, J. Kleinberg, E. Tardos posted to influence socialnetwork spread by mangesh on 2008-03-26 16:09:42 as along with 13 people and 6 groups sidmitra korakot trunov A_Olympia pdlug yish mukundn scis0000001 krisl avivagabriel adriandefroment deysandeep mjchernyk Philosophy_of_Information Blog_and_Wiki_Research mathgamespatterns dtl vds-arg eni
	On complexity as bounded rationality (extended abstract) [My Copy] In STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (1994), pp. 726-733. by Christos H. Papadimitriou, Mihalis Yannakakis posted to boundedrationality complexity gametheory by mangesh on 2007-02-23 15:41:50 as
	Computing the shortest path: <i>A</i> search meets graph theory [My Copy] In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (2005), pp. 156-165. by Andrew V. Goldberg, Chris Harrelson posted to shortestpath by mangesh on 2007-02-20 15:25:34 as
	You and your Research [My Copy] (7 April 1986) by Richard Hamming posted to methedology research by mangesh on 2007-02-20 15:05:18 as along with 1 person robotact
	The space complexity of approximating the frequency moments [My Copy] In STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996), pp. 20-29. by Noga Alon, Yossi Matias, Mario Szegedy posted to pad complexity by mangesh on 2007-02-07 06:26:46 as along with 5 people mogwaing idlebrain ChaTo donade abie
	The LCA Problem Revisited [My Copy] In Latin American Theoretical INformatics (2000), pp. 88-94. by Michael A. Bender, Martin Farach-Colton posted to pad algorithm by mangesh on 2007-02-07 06:25:16 as along with 3 people and 1 group dherman damaru gvdh NU-PRL
	Should Tables Be Sorted? [My Copy] J. ACM, Vol. 28, No. 3. (July 1981), pp. 615-628. by Andrew C. Yao posted to pad cellprobecomplexity algorithms by mangesh on 2007-02-07 06:24:47 as along with 1 person AbnerCYH
	A theory of the learnable [My Copy] Commun. ACM, Vol. 27, No. 11. (November 1984), pp. 1134-1142. by L. G. Valiant posted to pad machinelearning by mangesh on 2007-02-07 06:16:58 as along with 6 people misovalko mthomure sdvillal AbnerCYH dwf bsilverthorn
	Optimal algorithms for approximate clustering [My Copy] In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988), pp. 434-444. by Tom&\#225;s Feder, Daniel Greene posted to pad clustering algorithms by mangesh on 2007-02-05 20:47:49 as
	Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time [My Copy] (9 Oct 2003) by Daniel A. Spielman, Shang-Hua Teng posted to smoothedanalysis simplex pad algorithm by mangesh on 2007-02-04 16:46:12 as
	Technical Note: Q-Learning [My Copy] Machine Learning, Vol. V8, No. 3. (1 May 1992), pp. 279-292. by Christopher J. C. H. Watkins, Peter Dayan posted to reinforcementlearning pad by mangesh on 2007-02-02 18:27:24 as along with 2 people ddahlem Bc91
	Multi-agent reinforcement learning: a critical survey [My Copy] (2003) by Y. Shoham, R. Powers, T. Grenager posted to reinforcementlearning multiagent by mangesh on 2007-02-02 15:54:41 as along with 4 people ddahlem dowlingj arturo_servin yarapavan
	Multiagent reinforcement learning: theoretical framework and an algorithm [My Copy] In Proc. 15th International Conf. on Machine Learning (1998), pp. 242-250. by Junling Hu, Michael P. Wellman posted to reinforcementlearning nashequilibrium games by mangesh on 2007-02-02 15:54:10 as along with 1 person education03
	Automated mechanism design: Complexity results stemming from the single-agent setting [My Copy] (2003) by V. Conitzer, T. Sandholm posted to mechanismdesign complexity by mangesh on 2007-01-31 21:43:11 as
	Computational criticisms of the revelation principle [My Copy] (2003) by V. Conitzer, T. Sandholm posted to mechanismdesign critique by mangesh on 2007-01-31 21:40:26 as
	Group strategyproofness and no subsidy via lp-duality [My Copy] (1999) by K. Jain, V. Vazirani posted to groupstrategyproof linearprogramming mechanism by mangesh on 2006-12-19 00:16:49 as
	$My PDF p&\#225;l_03_group.pdf$ Group Strategyproof Mechanisms via Primal-Dual Algorithms [My Copy] In FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003) by Martin P&\#225;l, \ &\#201;va Tardo posted to groupstrategyproof linearprogramming mechanism by mangesh on 2006-12-19 00:15:43 as
	Frugality ratios and improved truthful mechanisms for vertex cover [My Copy] (26 Jul 2006) by Edith Elkind, Leslie A. Goldberg, Paul W. Goldberg posted to frugal truthful vertexcover by mangesh on 2006-12-19 00:14:43 as
	Applications of approximation algorithms to cooperative games [My Copy] In STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing (2001), pp. 364-372. by Kamal Jain, Vijay Vazirani posted to approximation mechanism truthful by mangesh on 2006-12-19 00:13:15 as
	Equitable cost allocations via primal-dual-type algorithms [My Copy] In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002), pp. 313-321. by Kamal Jain, Vijay V. Vazirani posted to fair linearprogramming truthful by mangesh on 2006-12-19 00:11:27 as
	New trade-offs in cost-sharing mechanisms [My Copy] In STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (2006), pp. 79-88. by Tim Roughgarden, Mukund Sundararajan posted to approximation mechanism truthful by mangesh on 2006-12-19 00:11:00 as
	From optimal limited to unlimited supply auctions [My Copy] In EC '05: Proceedings of the 6th ACM conference on Electronic commerce (2005), pp. 175-182. by Jason D. Hartline, Robert Mcgrew posted to auction profit by mangesh on 2006-12-19 00:08:57 as
	The Price of Truth: Frugality in Truthful Mechanisms [My Copy] In STACS '03: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (2003), pp. 608-619. by Kunal Talwar posted to frugal truthful by mangesh on 2006-12-19 00:08:04 as
	Frugal path mechanisms [My Copy] In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (2002), pp. 991-999. by Aaron Archer, \ &\#201;va Tardos posted to frugal truthful by mangesh on 2006-12-19 00:06:46 as
	Beyond VCG: Frugality of Truthful Mechanisms [My Copy] In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (2005), pp. 615-626. by Anna R. Karlin, David Kempe, Tami Tamir posted to frugal truthful by mangesh on 2006-12-19 00:04:39 as
	First-price path auctions [My Copy] In EC '05: Proceedings of the 6th ACM conference on Electronic commerce (2005), pp. 203-212. by Nicole Immorlica, David Karger, Evdokia Nikolova, Rahul Sami posted to auction by mangesh on 2006-12-19 00:04:09 as
	Truthful and Near-Optimal Mechanism Design via Linear Programming [My Copy] In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (2005), pp. 595-604. by Ron Lavi, Chaitanya Swamy posted to approximate linearprogramming truthful by mangesh on 2006-12-19 00:03:19 as
	Incentive compatible multi unit combinatorial auctions [My Copy] In TARK '03: Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge (2003), pp. 72-87. by Yair Bartal, Rica Gonen, Noam Nisan posted to combinatorialauction truthful by mangesh on 2006-12-19 00:02:40 as
	Truthful randomized mechanisms for combinatorial auctions [My Copy] In STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (2006), pp. 644-652. by Shahar Dobzinski, Noam Nisan, Michael Schapira posted to mechanism randomized truthful by mangesh on 2006-12-19 00:01:45 as
	Truthful Mechanisms for One-Parameter Agents [My Copy] In FOCS '01: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science (2001) by A. Archer, &\#201; posted to truthful by mangesh on 2006-12-19 00:00:27 as
	Collusion-resistant mechanisms for single-parameter agents [My Copy] In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (2005), pp. 620-629. by Andrew V. Goldberg, Jason D. Hartline posted to groupstrategyproof mechanism by mangesh on 2006-12-18 23:56:36 as
	Algorithmic mechanism design (extended abstract) [My Copy] In STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of computing (1999), pp. 129-140. by Noam Nisan, Amir Ronen posted to mechanismdesign by mangesh on 2006-12-18 23:54:53 as
	Approximation algorithms and online mechanisms for item pricing [My Copy] In EC '06: Proceedings of the 7th ACM conference on Electronic commerce (2006), pp. 29-35. by Maria-Florina Balcan, Avrim Blum posted to approximation mechanism by mangesh on 2006-12-18 23:53:26 as
	Commuting differential operators with regular singularities [My Copy] (29 Nov 2006) by Toshio Oshima posted to no-tag by mangesh on 2006-12-02 17:38:57 as
	Collusion-Resistant Mechanisms for Single-Parameter Agents [My Copy] by Andrew V. Goldberg, Jason D. Hartline posted to groupstrategyproof mechanism by mangesh on 2006-12-01 17:29:05 as
	Frugal path mechanisms [My Copy] by A. Archer, E. Tardos posted to frugal mechanismdesign by mangesh on 2006-12-01 17:27:50 as

Note: You may cite this page as: http://www.citeulike.org/user/mangesh

truthful	11
mechanism	8
pad	7
frugal	5
groupstrategyproof	4
linearprogramming	4
mechanismdesign	4
approximation	3
complexity	3
reinforcementlearning	3
algorithm	2
algorithms	2
auction	2
approximate	1
boundedrationality	1
cellprobecomplexity	1
clustering	1
combinatorialauction	1
critique	1
fair	1
games	1
gametheory	1
influence	1
machinelearning	1
methedology	1
multiagent	1
nashequilibrium	1
profit	1
randomized	1
research	1
shortestpath	1
simplex	1
smoothedanalysis	1
socialnetwork	1
spread	1
vertexcover	1

mangesh's library 36 articles Export

mangesh's tags