新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

mangesh library [36 articles]

最近 mangesh さんのライブラリ .
  • Maximizing the spread of influence through a social network
    (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 12 people and 6 groups 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)
    (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
    (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
    (7 April 1986)
    by Richard Hamming
    posted to methedology research by mangesh on 2007-02-20 15:05:18 as read
  • The space complexity of approximating the frequency moments
    (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 burtonwu ChaTo donade abie gimbiri
  • The LCA Problem Revisited
    (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?
    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
    Commun. ACM, Vol. 27, No. 11. (November 1984), pp. 1134-1142.
    by LG Valiant
    posted to pad machinelearning by mangesh on 2007-02-07 06:16:58 as read along with 5 people mthomure sdvillal AbnerCYH dwf bsilverthorn
  • Optimal algorithms for approximate clustering
    (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
    (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
    Machine Learning, Vol. V8, No. 3. (1 May 1992), pp. 279-292.
    by Christopher JCH Watkins, Peter Dayan
    posted to reinforcementlearning pad by mangesh on 2007-02-02 18:27:24 as read along with 1 person Bc91
  • Multi-agent reinforcement learning: a critical survey
    (2003)
    by Y Shoham, R Powers, T Grenager
    posted to reinforcementlearning multiagent by mangesh on 2007-02-02 15:54:41 as read along with 4 people yarapavan arturo_servin ddahlem dowlingj
  • Multiagent reinforcement learning: theoretical framework and an algorithm
    (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 ***
  • Automated mechanism design: Complexity results stemming from the single-agent setting
    (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
    (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
    (1999)
    by K Jain, V Vazirani
    posted to groupstrategyproof linearprogramming mechanism by mangesh on 2006-12-19 00:16:49 as read
  • Group Strategyproof Mechanisms via Primal-Dual Algorithms
    (2003)
    by Martin P&\#225;l, &\#201;va Tardo
    posted to groupstrategyproof linearprogramming mechanism by mangesh on 2006-12-19 00:15:43 as read
  • Frugality ratios and improved truthful mechanisms for vertex cover
    (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 read
  • Applications of approximation algorithms to cooperative games
    (2001), pp. 364-372.
    by Kamal Jain, Vijay Vazirani
    posted to approximation mechanism truthful by mangesh on 2006-12-19 00:13:15 as read
  • Equitable cost allocations via primal-dual-type algorithms
    (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 read
  • New trade-offs in cost-sharing mechanisms
    (2006), pp. 79-88.
    by Tim Roughgarden, Mukund Sundararajan
    posted to approximation mechanism truthful by mangesh on 2006-12-19 00:11:00 as read
  • From optimal limited to unlimited supply auctions
    (2005), pp. 175-182.
    by Jason D Hartline, Robert Mcgrew
    posted to auction profit by mangesh on 2006-12-19 00:08:57 as read
  • The Price of Truth: Frugality in Truthful Mechanisms
    (2003), pp. 608-619.
    by Kunal Talwar
    posted to frugal truthful by mangesh on 2006-12-19 00:08:04 as read
  • Frugal path mechanisms
    (2002), pp. 991-999.
    by Aaron Archer, &\#201;va Tardos
    posted to frugal truthful by mangesh on 2006-12-19 00:06:46 as read
  • Beyond VCG: Frugality of Truthful Mechanisms
    (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 read
  • First-price path auctions
    (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 read
  • Truthful and Near-Optimal Mechanism Design via Linear Programming
    (2005), pp. 595-604.
    by Ron Lavi, Chaitanya Swamy
    posted to approximate linearprogramming truthful by mangesh on 2006-12-19 00:03:19 as read
  • Incentive compatible multi unit combinatorial auctions
    (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 read
  • Truthful randomized mechanisms for combinatorial auctions
    (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 read
  • Truthful Mechanisms for One-Parameter Agents
    (2001)
    by A Archer, &\#201;
    posted to truthful by mangesh on 2006-12-19 00:00:27 as read
  • Collusion-resistant mechanisms for single-parameter agents
    (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 read
  • Algorithmic mechanism design (extended abstract)
    (1999), pp. 129-140.
    by Noam Nisan, Amir Ronen
    posted to mechanismdesign by mangesh on 2006-12-18 23:54:53 as read
  • Approximation algorithms and online mechanisms for item pricing
    (2006), pp. 29-35.
    by Maria-Florina Balcan, Avrim Blum
    posted to approximation mechanism by mangesh on 2006-12-18 23:53:26 as read
  • Commuting differential operators with regular singularities
    (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
    by Andrew V Goldberg, Jason D Hartline
    posted to groupstrategyproof mechanism by mangesh on 2006-12-01 17:29:05 as **
  • Frugal path mechanisms
    by A Archer, E Tardos
    posted to frugal mechanismdesign by mangesh on 2006-12-01 17:27:50 as **
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/mangesh

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.