• 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

• Introduction
  • Editor's Introduction
    • YILING CHEN
• Mechanism Design and Differential Privacy
  • Buying Private Data at Auction: The Sensitive Surveyor's Problem
    • AARON ROTH
• Fair Division
  • Rationing Problems in Bipartite Networks
    • HERVE J. MOULIN and JAY SETHURAMAN
• Inefficiency of Equilibria
  • The Price of Anarchy in Games of Incomplete Information
    • TIM ROUGHGARDEN
• Routing Games
  • Stochastic Selfish Routing
    • EVDOKIA NIKOLOVA and NICOLAS STIER-MOSES
• Approximate Nash Equilibria
  • Computing Approximate Pure Nash Equilibria in Congestion Games
    • IOANNIS CARAGIANNIS, ANGELO FANELLI, NICK GRAVIN, and ALEXANDER SKOPALIK
• Approximate Optimal Auctions
  • How to Approximate Optimal Auctions
    • NIMA HAGHPANAH, NICOLE IMMORLICA, VAHAB MIRROKNI, and KAMESH MUNAGALA
• Economics of Carbon Credits
  • Carbon Footprint Optimization: Game Theoretic Problems and Solutions
    • DEEPAK BAGCHI, SHANTANU BISWAS, Y. NARAHARI, P. SURESH, L. UDAYA LAKSHMI, N. VISWANADHAM, and S. V. SUBRAHMANYA
• Puzzle Solution
  • Solution to Exchanges 10.2 Puzzle: Borrowing in the Limit as our Nerdiness Goes to Infinity
    • RAN I. SHORRER

ISSN 1551-9031

2025 Copyright, Association for Computing Machinery