- Econometrica, Vol. 74, No. 5 (September, 2006), 14031417 WHO'S WHO IN NETWORKS. WANTED: THE KEY PLAYER
- Game-Theoretic Aspects of Designing Hyperlink Nicole Immorlica, Kamal Jain, and Mohammad Mahdian
- Representability of matroids Greg McGlynn
- EECS 495: Randomized Algorithms Lecture 5 Lower Bounds for Randomized Alg.
- Algorithmic and Economic Aspects of Networks
- Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees
- Externalities in Keyword Auctions: an Empirical and Theoretical Assessment
- Click Fraud Resistant Methods for Learning Click-Through Rates
- Strategic Network Formation with Structural Holes Jon Kleinberg
- Aggregating Inconsistent Information: Ranking and Clustering
- Balloon Popping With Applications to Ascending Auctions Nicole Immorlica
- Algorithmic and Economic Aspects of Networks
- EECS 495: Combinatorial Optimization Lecture 1 Matching: Konig's Theorem, Tutte-Berge Formula
- Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks
- Algorithmic and Economic Aspects of Networks
- The role of compatibility in the diffusion of technologies in social networks
- EECS 495: Randomized Algorithms Lecture 8 Reading: Text
- EECS 495: Randomized Algorithms Lecture 6 Moments and Deviations
- Coordination Mechanisms for Selfish Scheduling Nicole Immorlica1
- Cycle cover with short cycles Nicole Immorlica
- Foundations and Trends R Theoretical Computer Science
- Bargaining Solutions in a Social Network Tanmoy Chakraborty and Michael Kearns
- A Knapsack Secretary Problem with Applications
- The Myth of the Folk Theorem Christian Borgs
- Online Auctions and Generalized Secretary MOSHE BABAIOFF
- Emergence of Cooperation in Anonymous Social Networks through Social Capital
- First-Price Path Auctions Nicole Immorlica
- Algorithmic and Economic Aspects of Networks
- Algorithmic and Economic Aspects of Networks
- EECS 495: Randomized Algorithms Lecture 1 Logistics, Overview, Application: Sorting
- Coalition Formation and Price of Anarchy in Cournot Oligopolies
- EECS 495: Combinatorial Optimization Lecture 6 Reading: Schrijver, Chapter 39
- MATROID UNION ALECK JOHNSEN
- EECS 495: Combinatorial Optimization Lecture 4 Matching: Edmonds-Gallai Decomposition, Matching Polytope,
- EECS 495: Combinatorial Optimization Lecture 11 Submodular Functions
- Limitations of cross-monotonic cost-sharing schemes Nicole Immorlica
- EECS 495: Randomized Algorithms Lecture 14 Random Walks
- PASS Approximation: A Framework for Analyzing and Designing Heuristics
- Approximating Matches Made in Heaven (Extended Abstract)
- A Combinatorial Allocation Mechanism With Penalties For Banner Advertising
- Derandomization of Auctions Gagan Aggarwal
- FEEs IDCs TDCs MDCsDetector ground Happy scientist
- EECS 495: Combinatorial Optimization Lecture 2 Matching: Edmonds-Gallai Decomposition, Edmonds' Algorithm
- EECS 495: Combinatorial Optimization Lecture 10 Matroid Intersection
- EECS 495: Combinatorial Optimization Lecture 12 Ellipsoid, Polar Polytopes
- EECS 495: Combinatorial Optimization Lecture Manolis, Nima Mechanism Design with Rounding
- EECS 495: Combinatorial Optimization Lecture 1 Shannon's Switching Game
- Discrete Applied Mathematics 34 (1991) 165-201 North-Holland
- EECS 495: Randomized Algorithms Lecture 2 Background Tour
- EECS 495: Randomized Algorithms Lecture 3 Ordering Tournaments
- BALANCED ALLOCATIONS YOSSI AZAR, ANDREI Z. BRODER, ANNA R. KARLIN, AND ELI UPFAL
- EECS 495 Homework1: Max-flow Min-Cut Through Hang Zhou, Jiang Xu
- Nima Haghpanah, Tom Hayden, Michael Lucas Randomized Algs Assignment 1
- Algorithmic and Economic Aspects of Networks
- Algorithmic and Economic Aspects of Networks
- Journal of Economic Theory 135 (2007) 478494 www.elsevier.com/locate/jet
- Equilibrium Pricing with Positive Externalities (Extended Abstract)
- EECS 495: Combinatorial Optimization Lecture 3 Matching: Edmonds-Gallai Decomposition
- Graph structure in the web Andrei Broder1, Ravi Kumar2, Farzin Maghoul1,
- First-Price Procurement Auctions Nicole Immorlica
- EECS 495: Randomized Algorithms Lecture 7 Using Chernoff
- EECS 495: Combinatorial Optimization Lecture 9 Matroid Intersection
- Dynamics of bid optimization in online advertisement auctions
- Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications
- Secretary problems with competing employers Nicole Immorlica1
- EECS 495: Randomized Algorithms Lecture 12 Online Primal-Dual
- EECS 495: Combinatorial Optimization Lecture 7 Matroid Representation, Matroid Optimization
- PASS Approximation: A Framework for Analyzing and Designing Heuristics
- EECS 495: Randomized Algorithms Lecture 13 Multi-armed Bandits
- Behavioral Experiments in Networked Trade J. Stephen Judd
- EECS 495: Randomized Algorithms Lecture 10 Semi-definite Programming
- EECS 495: Combinatorial Optimization Lecture 5 Matching: TDI, Cunningham-Marsh
- Semantic Similarity Between Search Engine Queries Using Temporal Correlation
- Efficient Location Area Planning for Personal Communication Systems
- Optimal Auctions with Positive Network Externalities Nima Haghpanah
- Authoritative Sources in a Hyperlinked Environment JON M. KLEINBERG
- Computing with Strategic Agents Nicole Immorlica
- Yinzhi Cao, Kai Chen, Michael Li February 1, 2010
- EECS 495: Randomized Algorithms Lecture 11 Metric Embeddings
- EECS 495: Combinatorial Optimization Lecture 8 Matroid Intersection
- EECS 495: Randomized Algorithms Lecture 9 Reading: Text
- EECS 495: Randomized Algorithms Assignment 1
- Matroids, Secretary Problems, and Online Mechanisms Moshe Babaioff
- EECS 495, Winter 2010 Instructor: Nicole Immorlica
- EECS 495: Randomized Algorithms Lecture 4 Reading: Text: Chapter 1, Chapter 10
- LINEAR PROBING WITH CONSTANT INDEPENDENCE ANNA PAGH, RASMUS PAGH, AND MILAN RUZIC
- Nature Macmillan Publishers Ltd 1998 typically slower than 1 km s-1
- Testing Substitutability John William Hatfield
- Optimal Auctions with Positive Network Externalities Nima Haghpanah
- Dueling algorithms Nicole Immorlica
- On the Impossibility of Black-Box Truthfulness Without Priors Nicole Immorlica
- EECS 310: Discrete Math Lecture 6 Graph Theory
- EECS 310: Discrete Math Lecture 11 Reading: MIT OpenCourseWare 6.042
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310: Discrete Math Lecture 10 Reading: MIT OpenCourseWare 6.042
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310: Discrete Math Lecture 7 Graph Theory
- EECS 310, Fall 2010 Instructor: Nicole Immorlica
- EECS 310: Discrete Math Lecture 2 Logic, Proofs
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310: Discrete Math Lecture 14 Probability
- EECS 310: Discrete Math Lecture 7 Graph Theory
- EECS 310: Discrete Math Lecture 1 Overview, Logic
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310: Discrete Math Lecture 3 Proofs, Sets, Functions, Induction
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310: Discrete Math Lecture 8 Graph Theory
- EECS 310: Discrete Math Lecture 4 Sets, Induction
- EECS 310: Discrete Math Lecture 13 Probability
- EECS 310: Discrete Math Lecture 12 Reading: MIT OpenCourseWare 6.042
- EECS 310: Discrete Math Lecture 15 Probability
- EECS 310, Fall 2010 Instructor: Nicole Immorlica
- EECS 310, Fall 2011 Instructor: Nicole Immorlica
- EECS 310: Discrete Math Lecture 5 Graph Theory, Matching
- Market Design: Lecture 6 NICOLE IMMORLICA, NORTHWESTERN UNIVERSITY
- Market Design: Lecture 4 NICOLE IMMORLICA, NORTHWESTERN UNIVERSITY
- Market Design: Lecture 2 NICOLE IMMORLICA, NORTHWESTERN UNIVERSITY
- Market Design: Lecture 2 NICOLE IMMORLICA, NORTHWESTERN UNIVERSITY
- Market Design: Lecture 5 NICOLE IMMORLICA, NORTHWESTERN UNIVERSITY
- Market Design: Lecture 7 NICOLE IMMORLICA, NORTHWESTERN UNIVERSITY
- Market Design: Lecture 1 NICOLE IMMORLICA, NORTHWESTERN UNIVERSITY
