CPSCExam February 16, 2006 Answer four of the following five questions. If you answer all five, the first four of your answers will be graded, and the fifth will be ignored. Please remember to write your name,

First Page		Document Content
Date: 2006-02-24 16:30:58 Routing Game theory Border Gateway Protocol IP forwarding Convergence Strategyproofness Algorithm		CPSCExam February 16, 2006 Answer four of the following five questions. If you answer all five, the first four of your answers will be graded, and the fifth will be ignored. Please remember to write your name, Add to Reading List Source URL: zoo.cs.yale.edu Download Document from Source Website File Size: 41,00 KB Share Document on Facebook

	On the Tradeoff between Economic Efficiency and Strategyproofness in Randomized Social Choice Haris Aziz Felix Brandt DocID: 1sVWg - View Document
	Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving DocID: 1sQXP - View Document
	CPSC 455b: Written Homework Assignment #3 Due in class on Tuesday, April 16, 2002 These exercises are drawn from the following papers (all obtainable from http://pantheon.yale.edu/~sz38) and the related lectures and disc DocID: 1ro21 - View Document
	Distributed Algorithmic Mechanism Design: ∗ Recent Results and Future Directions † ‡ DocID: 1rico - View Document
	Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games? Dimitris Fotakis and Christos Tzamos School of Electrical and Computer Engineering, National Technical University of Athens, Athens, G DocID: 1reb6 - View Document