At 7:30am midway through EC’14 there was scheduled an Open discussion about the CS job market for Ph.D.s for Econ/CS people. Even at 7:30am the room was packed! David Parkes led the discussion, which focused on how to improve the academic job market for EC people. While Econ/CS Ph.D.s benefit from fantastic opportunities at industrial research laboratories, this demand has not translated to steady availability of positions in the academic job market. If attendance and participation in this discussion are any indication of the importance of this issue, then it is one we should devote significant effort and resources to resolving. This blog post serves to summarize the context and suggestions from the EC discussion and suggested action by the SIGecom executive committee as well as to solicit additional feedback from the community.

Identity. When academic positions come tied to areas, identity is an important issue. While many in the Econ/CS community come from an AI/ML or Algorithms/Theory background, many consider Econ/CS, henceforth EC, their primary research community. Nonetheless, EC faculty applicants will typically be competing for AI or Theory positions. Only a few schools have chosen to specifically list EC as a target area for hiring (independent of AI or Theory persuasion). In comparison Computational Biology, in the last decade, and Data Science, contemporaneously, have become first-order subfields with respect to hiring. One recommendation for hiring discussions is to separate EC from AI and Theory hiring. It is not to EC’s advantage to be in a zero-sum game with either AI or Theory.

Public Relations. EC does not presently have a clearly articulated value proposition that engenders broad investment from within CS, broad support for hiring from the Economics academic community, or broad visibility by the general public. One concrete action to take is to be more public about successes of our field in terms of impact on practice and impact on science (in particular Economics) and about the big challenges our field is hoping to address in the medium and long term. A second concrete action to take is to prepare development pitches, both at the department level for including EC in the vision for the department, and at the donor level to provide a basis for deans to raise money for faculty lines in EC. A third action item is to encourage more outreach articles in general computer science venues and in popular science venues.

Web Resources. The SIGecom advisors have discussed the idea of creating a web resource that would facilitate the initiative described above. In particular:

  1. To aggregate survey articles, general CS articles, popular science articles, and teaching materials (cf. Interactions.org).
  2. To collect and disseminate development resources, e.g., for faculty to pitch their department for EC hiring, for deans to pitch their donors for EC hiring, for researchers to pitch funding agencies (cf. Theory Matters).
  3. To collect advice for EC applicants to faculty positions outside of EC, e.g., operations research, business schools, information science, etc. These academic markets have different timings, structure, and focus.
  4. To collect job posts and publicize job market outcomes (cf. the computational complexity blog).
  5. To survey research themes and success, impact on practice, and impact on science.

The SIG would contribute resources to make sure that the web resource is well designed and hosted, and we plan to do all of this with a view to making sure that whatever we do is maintainable going forward.

Coordination. Turing’s Invisible Hand coblogger Jason Hartline has agreed to serve as the SIGecom 2014-2015 Special Initiatives Chair for the Job Market and will be coordinating the effort to assemble this web resource, recruiting volunteers, and facilitating the initiatives proposed above. Please agree to help if asked, write Jason to volunteer, or provide discussion in the comments below.

Joint post with SIGecom Chair David Parkes.

Berthold Vöcking, a leading researcher in algorithmic game theory and chair of the 2013 Symposium on Algorithmic Game Theory, sadly passed away on June 11th. Tim Roughgarden gave the following apt remarks before a moment of silence was held in commemoration of Berthold at ACM-EC two weeks ago:

Berthold was a phenomenal problem-solver, and he made numerous
contributions across many subfields of algorithmic game theory. To
name just a few, his celebrated paper with Czumaj resolved the price
of anarchy in the Koutsoupias-Papadimitriou scheduling model, the
model in which the POA was originally defined. His early work in
algorithmic mechanism design (e.g., with Briest and Krysta), which I
regularly teach in my classes, demonstrated the richness of the design
space for single-parameter problems. His work with Skopalik and
others characterized the computational complexity of computing
equilibria in congestion games. He was an exceptionally strong

The early registration period for ACM EC 2014 ends today.  Also, I’d like to draw your attention to this year’s EC tutorials (not without self-interest):

Recent progress in multi-dimensional mechanism design

Organizers: Yang Cai (UC Berkeley), Costis Daskalakis (MIT), and Matt Weinberg (MIT)

Abstract: Mechanism design in the presence of Bayesian priors has received much attention in the Economics literature, focusing among other problems on generalizing Myerson’s celebrated auction to multi-item settings. Nevertheless, only special cases have been solved, with a general solution remaining elusive. More recently, there has been an explosion of algorithmic work on the problem, focusing on computation of optimal auctions, and understanding their structure. The goal of this tutorial is to overview this work, with a focus on our own work. The tutorial will be self-contained and aims to develop a usable framework for mechanism design in multi-dimensional settings.

Axiomatic social choice theory: from Arrow’s impossibility to Fishburn’s maximal lotteries

Organizers: Felix Brandt (TU München)

Abstract: This tutorial will provide an overview of central results in social choice theory with a special focus on axiomatic characterizations as well as computational aspects. Topics to be covered include rational choice theory, choice consistency conditions, Arrovian impossibility theorems, tournament solutions, social decision schemes (i.e., randomized social choice functions), preferences over lotteries (including von Neumann-Morgenstern utility functions, stochastic dominance, and skew-symmetric bilinear utility functions), and the strategyproofness of social decision schemes. The overarching theme will be four escape routes from negative results such as the impossibilities due to Arrow and Gibbard-Satterthwaite: (i) restricting the domain of preferences, (ii) replacing choice consistency with variable-electorate consistency, (iii) only requiring expansion consistency, and (iv) randomization.

Bitcoin: the first decentralized digital currency

Organizers: Aviv Zohar (Hebrew Univ.)

Abstract: Bitcoin is a disruptive new protocol for a digital currency that has been growing in popularity.The most novel aspect of the protocol is its decentralized nature: It has no central entity in charge of the currency or backing it up, and no central issuer. Instead, Bitcoin is managed by a peer-to-peer network of nodes that process all its transactions securely. The protocol itself combines ideas from many areas of computer science. These range from its use of cryptographic primitives to secure transactions, its use of economic mechanisms to avoid denial-of-service attacks and to incentivize participation, through its solution to the Byzantine consensus problem, and the robust construction of its P2P network. The goal of the tutorial is to provide a basic understanding of the Bitcoin protocol, to discuss the main problems and challenges that it faces, and to provide a starting point for research on the protocol and its surrounding ecosystem.

Privacy, information economics, and mechanism design

Organizers: Cynthia Dwork (Microsoft Research), Mallesh Pai (UPenn), and Aaron Roth (UPenn)

Abstract: Internet scale interactions have implications to game theory and mechanism design in at least two ways. First, the ability of many entities to aggregate large amounts of sensitive data for purposes of financial gain has brought issues of privacy to the fore. As mechanism designers, it is therefore crucial that we understand both how to -model- agent costs for loss of privacy, as well as how to control them. Second, it has made “large markets and large games” the common case instead of the exception. Can mechanism designers leverage these large market conditions to design mechanisms with desirable properties that would not be possible to obtain in small games? What techniques can we use to enforce that players are “informationally small” with minimal assumptions on the economy? In this tutorial, we will discuss results and techniques from “differential privacy”, an approach developed over the last decade in the theoretical computer science literature, which remarkably can address both of these two issues. We will motivate the definition, and then show both how it can provably control agent costs for “privacy” under worst-case assumptions, and how it can be used to develop exactly and asymptotically truthful mechanisms with remarkable properties in various large market settings. We will survey recent results at the intersection of privacy and mechanism design, with the goal of getting participants up to the frontier of the research literature on the topic.


Suppose Alice, Bob, and Charlie want to decide who has to take out the garbage by playing the following game. Each of the players independently and simultaneously raises his hand or not. Alice loses if exactly one player raises his hand, whereas Bob loses if exactly two players raise their hands, and Charlie loses if either all or no players raise their hand. A normal-form representation of the situation looks as follows (Alice chooses rows, Bob columns, and Charlie matrices).


The game exhibits some peculiar phenomena despite the existence of a unique Nash equilibrium: Alice raises her hand, Bob does not raise his hand, and Charlie randomizes with equal probability. Charlie couldn’t be happier with the equilibrium as he will never have to take out the garbage (and could even decide who has to do the job by playing a pure strategy instead).

The security level of all players is 0.5 and the expected payoff in the Nash equilibrium is (0.5, 0.5, 1). However, the minimax strategies of Alice and Bob are different from their equilibrium strategies, i.e., they can guarantee their equilibrium payoff by not playing their respective equilibrium strategies (a phenomenon that was also observed by Aumann)! The solution in which all players play their minimax strategies obviously suffers from the fact this strategy profile fails to be an equilibrium: Both Alice and Bob would want to deviate. On top of that, the unique equilibrium is particularly weak in the sense that it fails to be quasi-strict, i.e., all players could as well play any other strategy without jeopardizing their payoff.

Quasi-strict equilibrium is an equilibrium refinement proposed in 1973 by Harsanyi and requires that all pure best responses are played with positive probability. Harsanyi showed that in almost all games all equilibria are quasi-strict. Indeed the three-player game above (taken from this paper) is one of the very few exceptions. Quasi-strict equilibrium is rather attractive from an axiomatic perspective. For example, it has been shown that the existence of quasi-strict equilibrium is sufficient to justify the assumption of common knowledge of rationality when players are ‘cautious’ (for more details see here and here).

In 1999, Henk Norde proved that every two-player game contains a quasi-strict equilibrium (via a rather elaborate proof using Brouwer’s fixed-point theorem), strengthening earlier results which showed existence in zero-sum games, bimatrix games with a finite number of equilibria, 2×n games, etc. Norde’s existence result implies that computing a quasi-strict equilibrium is PPAD-hard (while this problem was shown NP-hard for games with at least three players). Curiously, however, membership in PPAD for two-player games remains open due to the intricate existence proof by Norde (see also this review of Norde’s paper by Bernhard von Stengel).

Coming back to the example, it seems as if Charlie has to live with the deficiencies of Nash equilibrium and prepare to take out the garbage with positive probability.

Sperner’s Lemma hits the popular press

Here’s an article that has been trending on the New York Times site. It’s about Sperner’s Lemma–and, amazingly, they get the technical details right! The article describes a pretty practical scheme for pairing n indivisible goods with n agents; it’s motivated by the example of matching roommates with rooms, each of which has different pros and cons that the roommates each value differently. There’s a nice discussion of the idea of fair division, a pretty thorough description of a paper by Francis Su, a shout-out to Turing’s Invisible Hand Blogger Emeritus Ariel Procaccia and his web site spliddit, a quote from Stephen Brams, an online rent division calculator, and a very nice interactive graphic of how Sperner’s Lemma works.

So, what do you all think? Do you buy it? And, have you ever used a formal fair-division algorithm to make a real-life decision?

Blogger emeritus and COMSOC co-chair Ariel asked me to announce that the registration for COMSOC 2014 is open. The list of accepted papers can be found here. The invited speakers are Edward Felten, Jean-Francois Laslier, and Mark Satterthwaite.

Registration for the temporally co-located Meeting of the Society for Social Choice and Welfare (SCW) is open as well.


The organizers of the AdAuctions workshop have extended the submission deadline to April 27. Updated information on the workshop is as follows.

The Tenth Ad Auction Workshop  (here is the call for papers)

  • Date: June 8, 2014, 8:30-15:30
  • Submission deadline: April 27, 2014, (23:59 Hawaii time)
  • Organizing Committee: adauctionsworkshop2014@gmail.com
    Itai Ashlagi (MIT Sloan)
    Patrick Jordan (Microsoft)
    De Liu (University of Kentucky)
    Renato Paes Leme (Google)
    Chris Wilkens (Yahoo)
  • Keynote speakers: Hal Varian (Google) and Paul Milgrom (Stanford).