'Hardness results' presentation slideshows

Vertex Labelings and Colorings of Graphs

Vertex Labelings and Colorings of Graphs. Valia Mitsou Graduate Center & City College City University of New York . introduction. What is a Labeling/Coloring of a Graph .

2.09k views • 104 slides

Near-Optimal Algorithms for Unique Games

501 views • 41 slides

6.896: Topics in Algorithmic Game Theory

6.896: Topics in Algorithmic Game Theory. Lecture 8. Constantinos Daskalakis. 2 point Exercise. 5. NASH ? BROUWER (cont.):. - Final Point:.

461 views • 33 slides

Segment: Computational game theory Lecture 1b: Complexity

Segment: Computational game theory Lecture 1b: Complexity. Tuomas Sandholm Computer Science Department Carnegie Mellon University. Complexity of equilibrium concepts from (noncooperative) game theory. Solutions are less useful if they cannot be determined

224 views • 22 slides

Algorithmic aspects of the core in cooperative games over graphs

Algorithmic aspects of the core in cooperative games over graphs. Vangelis Markakis Athens University of Economics and Business Dept. of Informatics. Joint work with: Georgios Chalkiadakis, (University of Southampton) Nicholas R. Jennings (University of Southampton). Our focus.

303 views • 21 slides

Hardness Results for Problems

279 views • 18 slides

Hardness Results for Problems

310 views • 18 slides

Designing Floating Codes for Expected Performance

Designing Floating Codes for Expected Performance. Hilary Finucane Zhenming Liu Michael Mitzenmacher. Floating Codes. A new model for flash memory. State is an n -ary sequence of q -ary numbers. Represents block of n cells; each cell holds an electric charge.

240 views • 17 slides