Manipulation in games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 365-376

  Eidenbenz, Raphael ^a   Oswald, Yvonne Anne ^a   Schmid, Stefan ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ECONOMIC ANALYSIS; FINANCIAL DATA PROCESSING; THREE DIMENSIONAL COMPUTER GRAPHICS;

BENEVOLENT MECHANISM DESIGNERS;

ANIMATION;

EID: 38349036194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_33     Document Type: Conference Paper

References (8)

1. Alon, N., Moshkovitz, D., Safra, M.: Algorithmic Construction of Sets for k-Restrictions. ACM Transactions on Algorithms (TALG), 153-177 (2006)
2. Eidenbenz, R., Oswald, Y.A., Schmid, S., Wattenhofer, R.: Mechanism Design by Creditability. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, Springer, Heidelberg (2007)
3. Feige, U.: A Threshold of log n for Approximating Set Cover. Journal of the ACM, 634-652 (1998)
4. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based Mechanism for Lowest-Cost Routing. In: Proc. 21st Annual ACM Symp. on Principles of Distributed Computing (PODC) (2002)
5. Monderer, D., Tennenholtz, M.: k-Implementation. In: Proc. 4th ACM Conference on Electronic Commerce (EC), pp. 19-28 (2003)
6. Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. 31st Annual ACM Symposium on Theory of Computing (STOC) (1999)
7. Osborne, Rubinstein: A Course in Game Theory. MIT Press, Cambridge (1994)
8. Segal, I.: Contracting with Externalities. The Quarterly Journal of Economics, 337-388 (1999)