SPAA Archives

ACM SPAA Participants List


Options: Use Forum View

Use Monospaced Font
Show HTML Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
1.0 (Mac OS X Mail 9.3 \(3124\))
ACM SPAA Participants List <[log in to unmask]>
Patrick Loiseau <[log in to unmask]>
Sun, 29 Jan 2017 20:20:32 +0100
multipart/alternative; boundary="Apple-Mail=_868CA48F-F5DA-468D-BF50-A4535B139ECB"
Patrick Loiseau <[log in to unmask]>
text/plain (8 kB) , text/html (12 kB)
Call For Papers:

 NetEcon 2017: The 12th Workshop on the Economics of Networks, Systems and Computation
 In conjunction with ACM EC 2017
 June 26th or 27th 2017 (date to be finalized)
 MIT, Cambridge, MA, U.S.A. <>


* Ashish Goel, Stanford University
* Kartik Hosanagar, The Wharton School of the University of Pennsylvania
* Nicole Immorlica, Microsoft


The organizing committee is delighted to invite you to contribute to
NetEcon 2017, held in conjunction with EC 2017, on June 26th or 27th
(to be finalized) at MIT, Cambridge, MA. 

The emergence of the Internet as a global platform for computation and
communication has sparked the development and deployment of many
large-scale networked systems. Often these systems involve multiple
stakeholders with divergent or even competing interests. Unmitigated
selfish behavior in these systems can lead to high inefficiency or
even complete collapse. Research interest in the application of
economic and game-theoretic principles to the design and analysis of
networked systems has grown in recent years.  

The aim of NetEcon is to foster discussions on the application of
economic and game-theoretic models and principles to address
challenges in the development of networks and network-based
applications and services. The NetEcon Workshop also seeks to promote
multi-disciplinary investigations into the role of incentives in
communication and computation.  NetEcon was established in 2006
(succeeding to the P2PECON, IBC and PINS workshops) and merged with
the W-PIN workshop in 2013.

We invite submission of extended abstracts describing original
research on theoretical/methodological contributions or on
applications to cases of interest. It is our hope that NetEcon will
serve as a feeder workshop, with expanded and more polished versions
of the NetEcon extend abstracts submitted to major conferences
and refereed journals of the relevant research communities.


* Saturday April 22, 2017, 11:59pm EST: Submission deadline (firm)
* Monday May 22, 2017: Notification to authors
* Monday June 19, 2017: Final version for the workshop's website due
* Tuesday June 27 (or 26), 2017: Workshop at MIT
* Friday July 28, 2017: Final version for the proceedings due

Topics of interest to NetEcon'17 include but are not restricted to:
* Pricing of resources in communication networks, grids, and cloud computing
* Pricing of information goods and services; copyright issues, effect of network externalities (e.g., in social networks)
* Economic issues in universal broadband access; economics of interconnection and peering
* Effects of market structure and regulations (e.g., network neutrality, differential pricing and zero rating)
* Economics of network security and privacy; valuation of personal data
* Auctions with applications to networks: spectrum auctions, auction-based marketplaces for network and cloud resources
* Incentive mechanisms for networks: peer-to-peer systems, clouds, wireless networks, spam prevention, security
* Methods for engineering incentives and disincentives (e.g., reputation, trust, control, accountability, anonymity)
* Empirical studies of strategic behavior (or the lack thereof) in existing, deployed systems
* Design of incentive-aware network architectures and protocols
* Game-theoretic models and techniques for network economics: large games, learning, mechanism design, interaction of game theory and information theory or queuing theory, information exchange, diffusion, dynamics of cooperation and network formation, trades in social and economic networks
* Algorithmic mechanism design for network systems
* Critiques of existing models and solution concepts, as well as proposals of better models and solution concepts
* Studies of open collaboration, peer production, crowd-sourcing, and human computation.

Information about previous NetEcon workshops can be accessed at <> 


Submissions must be in the form of extended abstracts of at most 6
pages in the standard two-column format of ACM proceedings (including
all figures, tables, references, etc.) containing all important
results to allow evaluation of the novelty and scope of the
contribution. In case 6 pages are not sufficient to provide enough
information (e.g., proofs) to properly substantiate the paper's
results, we encourage the authors to provide supplementary material
either as a clearly marked appendix (without page limit) or by
including a link to the full version of their extended abstract. Such
supplementary material will, however, be read only at the discretion of
the PC members and will not appear in the proceedings in case of

Papers should be submitted through the submission website at <>

Note that authors for whom publication of a 6-page extended abstract
in the NetEcon proceedings would preclude later publication of an
expanded version in the relevant venue may elect to contribute only a
one-page abstract of their submitted extended abstract to the NetEcon
proceedings. Such an abstract should include the URL of a working
paper or preprint that contains the main results presented at the
NetEcon workshop. Authors can make this decision after receiving a
notice of acceptance.


* Vince Conitzer, Duke University, USA
* Roch Guerin, Washington University in St. Louis, USA

* Elliot Anshelevich, Rensselaer Polytechnic Institute (RPI)
* Sid Banerjee, Cornell University
* Liad Blumrosen, The Hebrew University of Jerusalem
* Rainer Böhme, University of Innsbruck
* Ozan Candogan, University of Chicago, Booth School of Business
* Augustin Chaintreau, Columbia University
* Jing Chen, Stony Brook University
* kc Claffy, CAIDA, University of California, San Diego
* Costas Courcoubetis, Singapore University of Technology & Design
* Sanmay Das, Washington University in St. Louis
* Amogh Dhamdhere, CAIDA, University of California, San Diego
* Constantine Dovrolis, Georgia Institute of Technology
* Paul Duetting, London School of Economics
* David Easley, Cornell University
* Rachid El-Azouzi, CERI, Université d'Avignon
* Jens Grossklags, Technical University of Munich
* Nima Haghpanah, Penn State University
* Kartik Hosanagar, The Wharton School of the University of Pennsylvania
* Nicole Immorlica, Microsoft
* Carlee Joe-Wong, Carnegie Mellon University
* Ramesh Johari, Stanford University
* Anna N. Karlin, University of Washington
* David Kempe, University of Southern California
* S. Keshav, University of Waterloo
* Sanjeev Khanna, University of Pennsylvania
* Scott Duke Kominers, Harvard University
* Dave Levin, University of Maryland, College Park
* Mingyan Liu, University of Michigan
* Patrick Loiseau, EURECOM
* John C.S. Lui, The Chinese University of Hong Kong
* Richard T.B. Ma, National University of Singapore
* Patrick Maillé, Telecom Bretagne
* Reshef Meir, Technion-Israel Institute of Technology
* Dah Ming Chiu, The Chinese University of Hong Kong
* Tyler Moore, University of Tulsa
* Jamie Morgenstern, University of Pennsylvania
* John Musacchio, University of California, Santa Cruz
* Thanh T. Nguyen, Purdue University
* Sigal Oren, Ben Gurion University
* Michael Schapira, The Hebrew University of Jerusalem
* Grant Schoenebeck, University of Michigan
* Galina Schwartz, University of California, Berkeley
* Sven Seuken, University of Zurich
* Nisarg Shah, University of Toronto
* David Starobinski, Boston University
* Nicolas Stier, Facebook
* Chaitanya Swamy, University of Waterloo
* Bruno Tuffin, INRIA Rennes Bretagne Atlantique
* Adrian Vetta,  McGill University
* Yevgeniy Vorobeychik,  Vanderbilt University
* Steven Weber, Drexel University

* John Chuang (UC Berkeley, USA)
* Nick Feamster (Georgia Tech, USA)
* Joan Feigenbaum (Yale University, USA)
* Daniel Grosu (Wayne State University, USA)
* Patrick Loiseau (EURECOM, France) -- chair
* Paul Spirakis (University of Liverpool, UK and Computer Technology Institute & Press “Diophantus” (CTI), Greece)
* R. Srikant (University of Illinois, Urbana-Champaign, USA)
* Milan Vojnovic (Microsoft Research, UK)
* Jean Walrand (UC Berkeley, USA)


For more information, please contact the organizers at
[log in to unmask] <mailto:[log in to unmask]> or visit the workshop website: <>