14th ACM Conference on Electronic Commerce
SECOND CALL FOR PAPERS AND CALL FOR WORKSHOP AND TUTORIAL PROPOSALS
14th ACM Conference on Electronic Commerce June 16-20, 2013 Philadelphia, PA
Since 1999 the ACM Special Interest Group on Electronic Commerce (SIGecom) has sponsored the leading scientific conference on advances in theory, systems, and applications at the interface of economics and computation, including applications to electronic commerce.
The Fourteenth ACM Conference on Electronic Commerce (EC'13) will feature invited speakers, paper presentations, workshops, and tutorials.
The conference will be held from Sunday, June 16, 2013 through Thursday, June 20, 2013 in Philadelphia, PA, USA. Accepted technical papers and invited talks will be presented from June 18 through June 20; tutorials and workshops will be held on June 16 and June 17. Accepted papers will be available in the form in which they are published in the ACM Digital Library one week before the conference.
The focus of the conference is research at the interface of economics and computation related to (but not limited to) the following three non-exclusive focus areas:
Theory and Foundations
Artificial Intelligence and Applied Game Theory
Experimental, Empirical, and Applications
Authors can designate a paper for one or two of these focus areas. Each area has dedicated SPC and PC members, allowing reviewers to come from the area(s) to which a paper was submitted; e.g., a paper submitted to the "Experimental, Empirical, and Applications" area will be reviewed by SPC and PC members in that area only; a paper submitted to two areas will be handled by the most qualified reviewers in the union of the two areas.
We are committed to accepting papers of the very highest quality on the interface between computer science and economics. If we receive a large number of such submissions we will hold some sessions in parallel, grouping these sessions by topic rather than by area.
Electronic Commerce publishes relevant papers on topics and methodologies that
Bargaining and negotiation
Behavioral models and experiments
Computational game theory
Computational social choice
Consumer search and online behavior
Crowdsourcing and collective intelligence
Economics of information
Experience with e-commerce systems and markets
Foundations of incentive compatibility
Game-theoretic models of e-commerce and the Internet
Platforms and services
Preferences and decision theory
Price of anarchy
Reputation and trust systems
Revenue optimization, pricing, and payments
Sponsored Search and other Electronic Marketing
Usability and Human Factors in E-Commerce Applications
User-Generated Content and Peer Production
Submissions should be made at http://www.sigecom.org/ec13/papers.html
The conference is soliciting full papers (as well as workshop and tutorial proposals; see below) on all aspects of research covered by the conference.
Submitted papers will be evaluated on significance, originality, technical quality, and exposition. They should clearly establish the research contribution, its relevance, and its relation to prior research. All submissions must be made in the appropriate format, and within a specified length limit; details and a LaTeX template can be found at the submission site.
Additional pages beyond the length limit may be included as appendices, but will only be read at the discretion of the reviewers.
IMPORTANT NOTICE: To accommodate the publishing traditions of different fields, authors of accepted papers can ask that only a one page abstract of the paper appear in the proceedings, along with a URL pointing to the full paper. Authors should guarantee the link to be reliable for at least two years. This option is available to accommodate subsequent publication in journals that would not consider results that have been published in preliminary form in a conference proceedings. Such papers must be submitted electronically and formatted just like papers submitted for full-text publication
Simultaneous submissions of results to another conference with published proceedings is not allowed. Results previously published or presented at another archival conference prior to EC, or published (or accepted for
publication) at a journal prior to the submission deadline to EC, will not be considered. Simultaneous submission of results to a journal is allowed only if the author intends to publish the paper as a one page abstract in EC'13. Papers that are accepted and appear as a one page abstract can be subsequently submitted for publication in a journal but may not be submitted to any other conference that has a published proceedings.
WORKSHOP AND TUTORIAL PROPOSALS
The conference is soliciting proposals for tutorials and workshops to be held in conjunction with the conference. Tutorial proposals should contain the title of the tutorial, a two-page description of the topic matter, the names and short biographies of the tutor(s), and dates/venues where earlier versions of the tutorial were given (if any). Workshop proposals should contain the title of the workshop, the names and short biographies of the organizers, and the names of confirmed or candidate participants. Workshop proposals should also include a two-page description describing the theme, the reviewing process for participants, the organization of the workshop, and required facilities for the workshop. Informal suggestions for workshop or tutorial ideas can also be sent without a full proposal to the workshop and tutorial chairs at any time.
Submission information can be found on the conference website.
February 11, 2013, 11:59 PM EST: Full electronic paper submissions due.
Please see http://www.sigecom.org/ec13/papers.html
February 18, 2013: Workshop and Tutorial proposals due. Send to:
firstname.lastname@example.org and email@example.com.
March 12, 2013: Tutorial & workshop proposal accept/reject
March 12, 2013: Reviews sent to authors for author feedback
March 14, 2013: Author responses due
April 5, 2013: Paper accept/reject notifications
April 28, 2013: Camera-ready version of accepted papers due
June 16-17, 2013: Conference Workshops and Tutorials, Philadelphia, PA
June 18-20, 2013: Conference Technical Program, Philadelphia, PA
Michael Kearns, University of Pennsylvania firstname.lastname@example.org
Preston McAfee, Google
Eva Tardos, Cornell University
Moshe Babaioff, Microsoft Research Silicon Valley
Ariel Procaccia, Carnegie Mellon University
Senior Program Committee:
Theory and Foundations SPC:
Moshe Babaioff, Microsoft Research, Silicon Valley
Aaron Bodoh-Creed, Cornell University
Costis Daskalakis, MIT
Nikhil R. Devanur, Microsoft Research, Redmond
David Easley, Cornell University
Drew Fudenberg, Harvard University
Jason Hartline, Northwestern University
Nicole Immorlica, Microsoft Research, New England
Anna Karlin, University of Washington
Robert Kleinberg, Cornell University
Ron Lavi, Technion and Yahoo! Labs
Herve Moulin, Rice University
Mallesh Pai, University of Pennsylvania
Christos Papadimitriou, University of California, Berkeley
Tim Roughgarden, Stanford University
Artificial Intelligence and Applied Game Theory SPC:
Arpita Ghosh, Cornell University
Sastien Lahaie, Microsoft Research, New York
Jeff MacKie-Mason, University of Michigan
Ariel Procaccia, Carnegie Mellon University
Justin Rao, Microsoft Research, New York
David Pennock, Microsoft Research, New York
Rakesh Vohra, Northwestern University
Michael Wellman, University of Michigan
Experimental, Empirical, and Application SPC:
Ital Ashlagi, MIT
Susan Athey, Stanford University
Ashish Goel, Stanford University
Panos Ipeirotis, New York University
Randall Lewis, Google
Rahul Sami, University of Michigan and Google
Siddharth Suri, Microsoft Research, New York
Utku Unver, Boston College
Full Program Committee:
General inquiries and requests pertaining to the conference should be sent to:
Inquiries and requests pertaining specifically to the program, and in
particular to paper submission and decision status, should be sent to:
Inquiries and requests pertaining specifically to workshop and tutorials should
be sent to: email@example.com and firstname.lastname@example.org.