The 16^{th} ACM Conference on Economics and Computation (EC 2015) will be held on June 15-19, as part of FCRC 2015, in Portland, Oregon. The Call for Papers is now out. As in previous years, to accommodate the publishing traditions of different fields (i.e., subsequent publications in Econ/other journals), authors of accepted papers are allowed to publish only a one page abstract in the proceedings. Looking forward to your contribution and participation!

Posted in Uncategorized | Leave a Comment »

As part of an initiative to improve the CS-Econ academic job market, this blog post is to provide initial information for Econ-CS students who are interested in applying to business schools and operations research (OR) departments. Special thanks for coauthoring this post are due to guest bloggers Itai Ashlagi (MIT, Sloan) and Jacob Leshno (Columbia Business School).

Business schools have a variety of groups, different schools are organized differently and groups differ by their names. The most relevant groups are in the area of Operations (such as Operations Management, Operations Research), Decisions (such Decision Sciences and Information Science), and depending on your research you might find connections to Marketing or Strategy groups. It is worthwhile to spend some time looking online and engaging your contacts to learn more about different places that might be interested in you. This post will focus mostly on the Operations job market although some information is related to all of these areas.

Job market candidates who have further questions that are not answered below are encouraged to email either of the authors of this post. Answers to any general-interest questions will be included in future updates.

**When does the job market take place?**

The typical recruiting process for Operations-like groups starts by asking applicants to submit a partial application due October or November. The early applications are used for conducting short interviews/meetings with candidates in INFORMS (a big annual conference in OR and Management Science which will take place this year on November 9-12). In addition to short interviews, departments will send to representatives attend talks of potential candidate who are presenting at INFORMS (information regarding the talk should be included in the early application).

Deadlines for “full” applications are usually after INFORMS (between Thanksgiving and January and vary quite a bit), and flyouts (campus interviews) take place between January and March. Applying early for short interviews is not a requirement.

Some Marketing groups have faculty that do quantitative research and may be interested in CS-Econ work. The Marketing job market begins very early (application deadlines are around August) and campus interviews are around October-November. We hope to collect more information about this market in the future.

**How to apply?**

Information about OR-like job postings can be found at Operations Academia. Also check the INFORMS website under “Build your career“. Groups such as Decisions Sciences or Information Sciences may also post their jobs on economics job listings such as the AEA’s Job Openings for Economists.

**What can I read to be better prepared?**

General advice about the job market in economics and some for OR is given in the links below. Although the economics job market is a bit different, much of the advice is very relevant to candidate going to OR-like jobs and is recommended to read:

- Operations Academia‘s advice for the Operations job market.

- The Stanford Economics Department’s advice for the job market.

- John Cawley’s A Guide and Advice for Economists on the U.S. Junior Academic Job Market.

- David Laibson’s Job Market Tips.

**What should be my job talk/job market paper?**

This is a tough question as the OR-like market is somewhere between economics and CS in several ways. CS candidate typically have many papers while economics students typically have only a few polished papers. The job talk/job market paper should showcase that you have an agenda, even if your results are dispersed between different papers. You want to convey that you have a well formed research direction and make your work relevant and interesting to your audience. To make your work relevant, remember that the audience of your talk does not necessarily have a CS background and so you should not assume they are familiar with CS methods or justification. You must explain why your result is a good result.

It is important to have a job market paper (see advice about job market papers for econonomics students).

**When should I start preparing for this job market?**

As early as possible. We would suggest to start to thinking about the job market (job market paper) at least two years before graduating. When you are conducting research, think how it will fit into a cohesive research portfolio. Going to conferences and communicating with colleagues from other fields will help you understand how to interest them in your research when you are on the market. Finding and working on more general materials (like applications, statements, etc.) usually happens after the summer of the year of graduation (or Marketing this begins before the summer). It is recommended not to wait until the fall to begin.

**How do business schools “count” conference publications?**

Different fields have different publication outlets. Business schools/OR care less about CS conference publications, although it is understood that candidates maybe come from different backgrounds. Journal publications are important and there are several top journals in the OR-like area. Common ones are Management Science and Operations Research. Top economics journals are also good. Other journals that are often considered good in different groups (such as Math or OR, Mathematical Programming, top economics field journals like GEB). It is in general good for students who are interested in such jobs to submit papers to good journals.

**Are there venues to present work prior to the job market in order to increase visibility?**

Yes. INFORMS is in the fall and MSOM (Manufacturing science and Operations Management) is in the early summer.

- INFORMS‘s call for papers is in the late spring and it is not very competitive. There are also organized (invited) sessions, typically there is a cluster on CS-Econ topics that is organized by someone in CS-Econ.

- MSOM‘s call for papers happens early in the spring and it is also not competitive. Submissions are just a summary of few pages. They have a mailing list one can register to get information not only about the conference (also many job postings are sent through this mailing list). MSOM has special sessions for job market candidates to give talks and these talks are recorded.

**What are the main things that business schools are looking for in interviews that are distinct from CS interviews?**

As in every interview, your interviewers are interested to learn about your work and to learn all your strengths. In contrast to CS interviews, they may not be familiar with some/many technical aspects of your work, so explaining your results may be more challenging. Business schools need people who can teach MBAs, and value the ability to communicate ideas in a non technical way. For example, your ability to clearly motivate to the (non-CS) audience of your job talk your CS methods can help demonstrate this ability. One-on-one interviewers will be looking for this ability as well. Also, candidates typically wear a suit to their interview.

Posted in Uncategorized | 2 Comments »

*As many of our readers know, New York Computer Science and Economics Day (NYCE) is a one-day gathering held annually in New York City to bring together people in the larger New York metropolitan area with interests in computer science, economics, marketing, and business, and with a common focus on understanding and developing the economics of Internet activity. *

*We are pleased to post the following announcement on behalf of the organizers of NYCE-2014.*

The 7th annual** New York Computer Science and Economics Day (NYCE-2014) **will take place on Friday, December 5th in Microsoft’s Times Square location (11 Times Square). We tentatively plan a panel, a mix of invited and contributed talks, and a poster session. More details are coming soon; the webpage (https://sites.google.com/site/nycsecon2014/) will be up in a few days.

**Organizers:** Arash Asadpour (NYU Stern), Mohammad Hossein Bateni (Google Research), Alex Slivkins (MSR-NYC).

Posted in Uncategorized | Leave a Comment »

Microsoft Research’s Silicon Valley Center (MSR/SVC) was the home of a truly amazing research team. The team began at Digital Equipment Company’s Systems Research Center (DEC/SRC) in the mid-eighties and, over the last thirty years, has been a pioneer of distributed systems research and an example of industrial research at its best. Its thirteen year run at MSR/SVC continued this tradition:

- as a collaboration between two pillars of computer science, systems and theory;
- as an industrial laboratory with unfettered academic freedom;
- as a lab where research prototypes transferred to deployed systems, like Dryad which shipped with Microsoft Server;
- as a lab where fundamental theory of computation was envisioned and brought to maturity, like differential privacy;
- as a lab that embraced and supported the greater academic community;
- as a lab that, since its contemporaneous founding with the then nascent field of
*economics and computation*(EC), was pivotal in its development.

Perhaps most importantly, MSR/SVC has had profound impact on several generations of researchers who visited as Ph.D.s in the internship program, or as postdocs, or as academic visitors. Indeed, many of these researchers have shared their experiences in the comments on Omer Reingold’s presumedly final Windows on Theory blog post.

My own story is similar to that of many others: My advisor Anna Karlin was a member of the team during its DEC/SRC years. (Thank you Anna!) My Ph.D. thesis originated from an auction question posed by the team’s Andrew Goldberg and is based on what became a nine-paper collaboration. (Thank you Andrew!) I clearly remember my 2003 job interview with Roy Levin in 2003, before the first academic paper on the subject, where he told me about the problem of sponsored search and the research challenges it posed for auction theory. (Thank you Roy!) On graduation I joined the team as a researcher and spent an amazing four years in which I could not have found a more supportive, stable, and stimulating environment to work on the theory of mechanism design. Collaborations with Andrew Goldberg developed the competitive analysis of auctions. Collaborations Moshe Babaioff and Alex Slivkins and lab visitors Avrim Blum, Nina Balcan, and Bobby Kleinberg brought connections to machine learning theory. Collaborations with visitors Shuchi Chawla and Bobby Kleinberg initiated the study of approximation in Bayesian mechanism design. Collaborations with lab visitor Madhu Sudan brought connections to coding theory. Discussions with Cynthia Dwork, Frank McSherry, and Kunal Talwar made connections to differential privacy. It was an incredible time to be with such an amazing group. MSR/SVC, thank you!

Last week MSR/SVC closed and with it did a chapter in the story of an elite team of researchers, a culture of collaboration, an institution of research excellence. I hope, just as the team survived acquisition by Compaq and Hewlett Packard in the late nineties, that this chapter is not its last. For myself, my cobloggers at Turing’s Invisible Hand, and on behalf of the EC research community; I would like to thank the MSR/SVC team for everything they have done for computer scientists, computer science, and the field of economics and computation.

Posted in Uncategorized | 2 Comments »

This year, the conference on web and Internet economics (WINE) will take place in Beijing, and will feature a poster session for the presentation of both original results that have not yet been published elsewhere and results published recently, which are relevant to the WINE community. While the deadline for regular paper submission has already passed, you still have time to submit your work to the poster session (deadline is September 15). This is a great opportunity to get your work exposed to the WINE community. More information can be found here: http://wine2014.amss.ac.cn/dct/page/70011

Posted in Uncategorized | Leave a Comment »

An important conjecture in prior-free mechanism design was affirmatively resolved this year. The goal of this post is to explain what the conjecture was, why its resolution is fundamental to the theoretical study of algorithms (and mechanisms), and encourage the study of important open issues that still remain.

The conjecture, originally from Goldberg et al. (2004), is that the lower bound of 2.42 on the approximation factor of a prior-free digital good auction is tight. In other words, the conjecture stated that there exists a digital good auction that, on any input, obtains at least a 2.42 fraction of the best revenue from a posted price that at least two bidders accept (henceforth: the benchmark). The number 2.42 arises as the limit as the number of agents *n* approaches infinity (for finite *n* the lower bound improves and is given by a precise formula). The conjecture was resolved in the affirmative by Ning Chen, Nick Gravin, and Pinyan Lu in a STOC 2014 paper Optimal Competitive Auctions. The resolution of this conjecture suggests that a natural method of proving a lower bound for approximation is generally tight but we still do not really understand why.

**Summary.**

To explain the statement of the theorem, let’s consider the *n = 2* special case. For *n = 2* agents, the benchmark is twice the lower agent’s value. (The optimal posted price that both bidders will accept is a price equal to the lower bidder’s value, the revenue from this posted price is twice the lower bidder’s value.) The goal of prior-free auction design is to find an auction that approximates this benchmark. For the *n = 2* special case there is a natural candidate: the second-price auction. The second-price auction’s revenue for two bidders is equal to the lower bidder’s value. Consequently, the second-price auction is a two approximation: the ratio of the second-price auction’s revenue to the benchmark is two in worst-case over all inputs (in fact, it is exactly equal to two on all inputs).

The Goldberg et al. (2004) lower bound for the *n = 2* agent special case shows that this two approximation is optimal. The proof of the lower bound employs the probabilistic method. A distribution over bidder values is considered, the expected benchmark is analyzed, the expected revenue of the optimal auction (for the distribution) is analyzed, and the ratio of their expectations gives the lower bound. The last step follows because any auction has at most the optimal auction revenue and if the ratio of the expectations has a certain value, there must be an input in the support of the distribution that has at least this ratio. A free parameter in this analysis is the the distribution over bidder values. The approach of Goldberg et al. was to use the distribution for which all auctions obtain the same revenue, i.e., the so-called equal revenue or Pareto distribution. This distribution is defined so that an agent with a random random value accepts a price *p > 1* with probability exactly *1/p* and the expected revenue generated is exactly one.

For more details see the newly updated Chapter 6 of Mechanism Design and Approximation.

**Discussion.**

Prior-free mechanism design falls into a genre of algorithm design where there is no pointwise optimal algorithm. For this reason the worst-case analysis of a mechanism is given relative to a benchmark. (The same is true for the field of online algorithms where this is referred to as competitive analysis.) In the abstract the optimal algorithm design problem is the following:

where

*ALG*is a possibly randomized algorithm. Let

*ALG**be the optimal algorithm. Yao’s minimax principle states that this is the same as:

where

*DIST*is a distribution over inputs and

*ALG*may as well be deterministic. Of course, if instead of maximizing over

*DIST*we consider some particular distribution

*DIST*we get a lower bound on the worst-case approximation of any algorithm. Let

*DIST**be the worst distribution for

*BENCHMARK*. In general

*DIST**should depend on

*BENCHMARK*.

Let *EQDIST* denote the product distribution for which the expected value of *ALG(INPUT)*, for *INPUT* drawn from *EQDIST*, is a constant for all auctions *ALG*. For a number of auction problems (not just digital goods), it was conjectured that *DIST* = EQDIST*. Two things are important in this statement:

*EQDIST*is a product distribution where as Yao’s theorem may generally require correlated distributions. (Why is a product distribution sufficient?!)

*EQDIST*is not specific to*BENCHMARK*. (Why not?!)

Prior to the Chen-Gravin-Lu paper the equality of *EQDIST* and *DIST** was known to hold for specific benchmarks and the following problems:

- Single agent monopoly pricing (for revenue). See Chapter 6 of MDnA.

- Two-agent digital-good auctions (for revenue). See Chapter 6 of MDnA.

- Three-agent digital-good auctions (for revenue). See Hartline and McGrew (2005).

- One-item two-agent auctions (for residual surplus, i.e., value minus payment).

Of these (1) and (2) are very simple, (3) and (4) are non-obvious. All of these results come from explicitly exhibiting the optimal auction

*ALG**.

Chen, Gravin, and Lu give the first highly non-trivial proof for showing that *DIST* = EQDIST* without explicitly constructing *ALG**. Moreover, they do it not just for the standard benchmark (given above) but for any benchmark with certain properties. It’s clear from their proof which properties they use (monotonicity, symmetry, scale invariance, constant in the highest value). It is not so clear which are necessary for the theorem. For example, the benchmark in (1) and (4), above, are not constant in the highest bid.

**Conclusion.**

Prior-free mechanism design problems are exemplary of an a genre of algorithm design problems where there is no pointwise optimal algorithm. (The competitive analysis of online algorithms gives another example.) These problems stress the classical worst-case algorithm design and analysis paradigm. We really do not understand how to search the space of mechanisms for prior-free optimal ones. (Computational hardness results are not known either.) We also do not generally know when and why the lower bounding approach above gives a tight answer. The Chen-Gravin-Lu result is the most serious recent progress we have seen on these questions. Let’s hope it is just the beginning.

Posted in Uncategorized | Leave a Comment »

The 7th International Symposium on Algorithmic Game Theory (SAGT) will take place in Patras, Greece, from September 30 to October 2. Notice the change in location (from the original Hafa, Israel).

Posted in Uncategorized | Leave a Comment »