Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Editor's introduction

Editor's introduction Editor's Introduction ARIEL D. PROCACCIA Carnegie Mellon University Issue 13.1 of SIGecom Exchanges includes a letter from the PC chairs of EC'14, a survey, and six research letters. Shuchi Chawla and Balasubramanian Sivan wrote this issue's survey, "Bayesian Algorithmic Mechanism Design". Classic algorithmic mechanism design, narrowly construed (in the sense introduced by Nisan and Ronen in 1999), studies the design of truthful, worst-case approximation algorithms for game-theoretic optimization problems. In contrast, in the Bayesian version, the designer is given stochastic information about possible inputs. This novel twist on the classic setting has generated significant excitement in the last few years. The survey covers the basics as well as the state of the art, and (as Shuchi and Balu note) is therefore aimed at both novices and experts. With the publication of issue 13.1, I am passing the editor's torch to Shaddin Dughmi, who is an Assistant Professor in the Department of Computer Science at the University of Southern California. I am grateful to the many authors who contributed to the most recent four issues of Exchanges (11.2, 12.1, 12.2, and 13.1). Special thanks go to the authors of the four longer surveys and position papers -- Eric Budish, Mallesh Pai, Aaron Roth, Alex Slivkins, Jenn Wortman Vaughan, Shuchi Chawla, and Balu Sivan -- for dedicating much of their time to making this new section of Exchanges (what I believe to be) an important resource for the community. And many, many thanks to Felix Fischer for his invaluable help as the SIG's information director! Author's address: arielpro@cs.cmu.edu. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Editor's introduction

Procaccia, Ariel D.
ACM SIGecom Exchanges , Volume 13 (1) – Nov 25, 2014
Download PDF
1 page

Loading next page...
 
/lp/association-for-computing-machinery/editor-s-introduction-0zam0nGV0y
Publisher
Association for Computing Machinery
Copyright
Copyright © 2014 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/2692375.2692376
Publisher site
See Article on Publisher Site

Abstract

Editor's Introduction ARIEL D. PROCACCIA Carnegie Mellon University Issue 13.1 of SIGecom Exchanges includes a letter from the PC chairs of EC'14, a survey, and six research letters. Shuchi Chawla and Balasubramanian Sivan wrote this issue's survey, "Bayesian Algorithmic Mechanism Design". Classic algorithmic mechanism design, narrowly construed (in the sense introduced by Nisan and Ronen in 1999), studies the design of truthful, worst-case approximation algorithms for game-theoretic optimization problems. In contrast, in the Bayesian version, the designer is given stochastic information about possible inputs. This novel twist on the classic setting has generated significant excitement in the last few years. The survey covers the basics as well as the state of the art, and (as Shuchi and Balu note) is therefore aimed at both novices and experts. With the publication of issue 13.1, I am passing the editor's torch to Shaddin Dughmi, who is an Assistant Professor in the Department of Computer Science at the University of Southern California. I am grateful to the many authors who contributed to the most recent four issues of Exchanges (11.2, 12.1, 12.2, and 13.1). Special thanks go to the authors of the four longer surveys and position papers -- Eric Budish, Mallesh Pai, Aaron Roth, Alex Slivkins, Jenn Wortman Vaughan, Shuchi Chawla, and Balu Sivan -- for dedicating much of their time to making this new section of Exchanges (what I believe to be) an important resource for the community. And many, many thanks to Felix Fischer for his invaluable help as the SIG's information director! Author's address: arielpro@cs.cmu.edu.

Journal

ACM SIGecom Exchanges – Association for Computing Machinery

Published: Nov 25, 2014

There are no references for this article.