• The SIG

• The Newsletter

  • Goals
  • Staff

• Current Issue

  • Table of Contents
  • Pdf Document
  • Zip Archive

• For Authors

  • Publication Schedule
  • Author Guidelines

• Archive

  • 2024 22.1
  • 2023 21.1
  • 2022 20.1 20.2
  • 2021 19.1 19.2
  • 2020 18.1 18.2
  • 2019 17.1 17.2
  • 2018 16.2
  • 2017 16.1
  • 2016 15.1 15.2
  • 2015 14.1 14.2
  • 2014 13.1 13.2
  • 2013 12.1 12.2
  • 2012 11.1 11.2
  • 2011 10.1 10.2 10.3
  • 2010 9.1
  • 2009 8.1 8.2
  • 2008 7.2 7.3
  • 2007 6.2 7.1
  • 2006 5.5 6.1
  • 2005 5.3 5.4
  • 2004 4.3 5.1 5.2
  • 2003 3.4 4.1 4.2
  • 2002 3.1 3.2 3.3
  • 2001 2.1 2.2 2.3
  • 2000 1.1

• Tweet

• News and Views
  • Editor's Introduction
    • SHADDIN DUGHMI
  • SIGecom News
    • DAVID C. PARKES
• Survey
  • Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned
    • TIM ROUGHGARDEN
• Letters
  • On Risk Measures, Market Making, and Exponential Families
    • JACOB D. ABERNETHY, RAFAEL M. FRONGILLO, and SINDHU KUTTY
  • Computational Aspects of Random Serial Dictatorship
    • HARIS AZIZ, FELIX BRANDT, MARKUS BRILL, and JULIÁN MESTRE
  • A Simple and Approximately Optimal Mechanism for an Additive Buyer
    • MOSHE BABAIOFF, NICOLE IMMORLICA, BRENDAN LUCIER, and S. MATTHEW WEINBERG
  • Network Improvement for Equilibrium Routing
    • UMANG BHASKAR and KATRINA LIGETT
  • Spliddit: Unleashing Fair Division Algorithms
    • JONATHAN GOLDMAN and ARIEL D. PROCACCIA
  • The Cost of Annoying Ads
    • DANIEL G. GOLDSTEIN, R. PRESTON MCAFEE, and SIDDHARTH SURI

ISSN 1551-9031

2025 Copyright, Association for Computing Machinery