AFLB
From ResearchWiki
(Difference between revisions)
(→Schedule) |
m |
||
| Line 9: | Line 9: | ||
** '''Parasaran''': [http://kalai.wik.is/@api/deki/files/17/=copycat-cameraready.pdf Playing Games without Observing Payoffs] (Adam Tauman Kalai, Michal Feldman, and Moshe Tennenholtz) | ** '''Parasaran''': [http://kalai.wik.is/@api/deki/files/17/=copycat-cameraready.pdf Playing Games without Observing Payoffs] (Adam Tauman Kalai, Michal Feldman, and Moshe Tennenholtz) | ||
** '''Jeff''': [http://www.cis.upenn.edu/~mkearns/papers/nwlocal.pdf Local Algorithms for Finding Interesting Individuals in Large Networks] (Mickey Brautbar and Michael Kearns) | ** '''Jeff''': [http://www.cis.upenn.edu/~mkearns/papers/nwlocal.pdf Local Algorithms for Finding Interesting Individuals in Large Networks] (Mickey Brautbar and Michael Kearns) | ||
| + | ** '''John''': [http://www.math.tau.ac.il/~nogaa/PDFS/leakage7.pdf Adversarial Leakage in Games] (Noga Alon, Yuval Emek, Michal Feldman and Moshe Tennenholtz) | ||
== Fall 2009 == | == Fall 2009 == | ||
Revision as of 23:36, 7 January 2010
The Algorithms For Lunch Bunch
Fridays at noon.
Contents |
Spring 2010
Jan 8, 2010
- Abstracts of papers accepted to ICS2010. Full versions of the papers is here.
- Suresh: Computational Complexity and Information Asymmetry in Financial Products. Sanjeev Arora, Boaz Barak, Markus Brunnermeier, Rong Ge
- Parasaran: Playing Games without Observing Payoffs (Adam Tauman Kalai, Michal Feldman, and Moshe Tennenholtz)
- Jeff: Local Algorithms for Finding Interesting Individuals in Large Networks (Mickey Brautbar and Michael Kearns)
- John: Adversarial Leakage in Games (Noga Alon, Yuval Emek, Michal Feldman and Moshe Tennenholtz)
Fall 2009
Oct 30, 2009
All: Discussion of topics for Spring 2010 Algorithms Seminar on Graph Algorithms
- planarity testing
- advanced MSTs ? randomized MST
- other randomized graph algorithms
- treewidth/pathwidth
- minors
- robertson seymour (in brief)
- Baker decomposition for planar graphs
- Klein-Borradaile results on new decompositions
- shortest paths, matrix mult, new developments
- evasiveness in graph properties, and the topological angle
- Spectral graph theory?
Nov 7, 2009
- John, Raj: Practice talks for FWCG 09
- Parasaran: Geometry of Soft Clusterings
Nov 14, 2009
No AFLB (FWCG 2009)
Nov 21, 2009
Review of FWCG papers:
- Wei Zeng, Rik Sarkar, Feng Luo, Xianfeng Gu, and Jie Gao. Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
- Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Approximating Voronoi Diagrams with Voronoi Diagrams
(2 page abstracts here)
Dec 4, 2009
- Graph isomorphism and volumes of convex bodies. Shmuel Friedland. Presented by Christopher Earl
Papers for discussion
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming. Monique Laurent. Mathematics of Operations Research, Vol. 28, No. 3 (May, 2003), pp. 470-496
- Natural Algorithms (Chazelle, SODA 09 Best paper)
- A constructive proof of the general Lovasz Local Lemma (Moser, earlier version STOC 09 Best Student Paper)
- Homology Flows, Cohomology Cuts (Chambers, Erickson and Nayyeri, STOC 09)
- Affiliation Networks (Lattanzi, Sivakumar, STOC 09)
- Sorting and Selection with Imprecise Comparisons (Ajtai, Feldman, Hassidim, Nelson, ICALP 09)
- Quantum Proofs for Classical Theorems (Drucker, Wolf)
