Proceedings of the 2017 ACM Conference on Economics and Computation

Proceedings of the 2017 ACM Conference on Economics and Computation
复制标题

2017 年 ACM 经济与计算会议论文集

DOI：
10.1145/3033274
复制
发表时间：
2017
期刊：
Proceedings of the 2017 ACM Conference on Economics and Computation
影响因子：
--
通讯作者：
H. Moulin
H. Moulin
中科院分区：
--
文献类型：
--
作者：
C. Daskalakis;Moshe Babaioff;H. Moulin

文献摘要

被引文献

相似文献

这些论文集中的论文于2017年6月26日至30日在美国马萨诸塞州剑桥市的麻省理工学院举行的第18届ACM经济与计算会议(EC‘17)上发表。自1999年以来，ACM电子商务特别兴趣小组(SIGecom)赞助了EC，这是一次领先的科学会议，主题是经济学和计算领域的理论、系统和应用方面的进展，包括电子商务的应用。 项目委员会从截至2017年2月13日收到的257篇论文中挑选了75篇论文。以下三个非排他性重点领域邀请提交论文： TF：理论和基础 人工智能与应用博弈论 EEA：实验、实验和应用 征集论文吸引了257份不同的意见书。每篇论文至少由三名计划委员会成员和两名高级计划委员会成员根据重要性、科学新颖性、技术质量、可读性和与会议的相关性进行审查。按照会议最近几次迭代的传统，要求提交人将提交的材料与一到两条轨道保持一致。下表汇总了每种可能的轨道组合的提交数量和被接受的论文数量。 在75篇被接受的论文中，有35篇发表在这些论文集上。对于剩余的40篇论文，应作者的要求，只包括摘要以及作者保证至少两年内可靠的完整工作文件的指针。这一选择适应了计算机科学以外的领域的做法，在这些领域中，会议出版可以排除期刊出版。我们预计这些论文集中的许多论文将以更精致和完整的形式出现在未来的科学期刊上。 在两次平行会议上提交了文件，但全体会议除外，以下获奖者作了发言： SIGecom最佳论文奖：组合成本分摊，作者：Shahar Dobzinski和Shahar Ovadia SIGecom博士学位论文奖，彭实 由于SIGecom最佳论文奖颁发给了一篇有学生主要作者的论文，因此没有单独颁发SIGecom最佳论文和学生主要作者奖。 为了强调欧共体研究的问题之间的共性，并便于会议上的交流，会议按主题而不是按重点领域组织，会议上没有说明论文的重点领域(S)，也没有在这些会议记录中出现。 EC‘17邀请了以下全体会议： 图形：大规模网络的建模、评估和设计算法的非参数方法，作者：Jennifer Chayes(微软研究院) 《机器学习的公平算法》，迈克尔·卡恩斯著(宾夕法尼亚大学) ACM SIGecom时间测试奖：近乎有效的组合拍卖中的真相揭示，作者：Daniel Lehmann，Liadan Ita O‘Callaghan和Yoav Shoham(ACM EC 1999，ACM杂志2002) 除了主要的技术计划外，EC‘17还包括四个研讨会： 第三届算法博弈论与数据科学研讨会。组织者：Jean Honorio，Denis Nekipelov，Renato Paes Leme，Yaron Singer，Vasilis Syrgkanis和Elie Tamer 机制设计促进社会公益讲习班。组织者：瑞迪特·阿贝贝和基拉·戈德纳 第12届网络、系统和计算经济学研讨会(NetEcon)PC主席：文森特·康尼泽和罗氏·盖林 预测研讨会。组织者：拉斐尔·弗兰吉罗、大卫·罗斯柴尔德和博·瓦格纳 五个教程： 安全与隐私的博弈论进展，由薄安、费方和叶夫根尼·沃罗贝奇克提出 孔玉清和格兰特·舍内贝克提出的信息激励机制的信息论观点 网络中的讨价还价、交易和协调：理论和挑战，本杰明·戈卢布 罗伯特·克莱因伯格和亚历山大·斯利夫金斯所著的《激励与协调探索》 组合市场中的定价：均衡和先知不等，由Michal Feldman和Brendan Lucier提出 此外，还举行了一次海报发布会，共展出了30张海报。
The papers in these Proceedings were presented at the Eighteenth ACM Conference on Economics and Computation (EC'17), held between June 26 and 30, 2017, at MIT in Cambridge, Massachusetts, USA. Since 1999 the ACM Special Interest Group on Electronic Commerce (SIGecom) has sponsored EC, the leading scientific conference on advances in theory, systems, and applications at the interface of economics and computation, including applications to electronic commerce. The program committee has selected 75 papers from among 257 submissions that were received by February 13, 2017. Paper submissions were invited in the following three non-exclusive focus areas: TF: Theory and Foundations AI: Artificial Intelligence and Applied Game Theory EEA: Experimental, Empirical, and Applications The call for papers attracted 257 distinct submissions. Each paper was reviewed by at least three program committee members and two senior program committee members on the basis of significance, scientific novelty, technical quality, readability, and relevance to the conference. Following the tradition of recent iterations of the conference, the authors were asked to align their submission with one or two of the tracks. The next table summarizes the number of submissions and the number of accepted papers for each possible combination of tracks. Out of the 75 accepted papers, 35 papers are published in these Proceedings. For the remaining 40 papers, at the authors' request, only abstracts are included along with pointers to full working papers that the authors guarantee to be reliable for at least two years. This option accommodates the practices of fields outside of computer science in which conference publishing can preclude journal publishing. We expect that many of the papers in these Proceedings will appear in a more polished and complete form in scientific journals in the future. Papers were presented in two parallel sessions, with the exception of a plenary session with talks for the following award-winners: SIGecom Best Paper Award: Combinatorial Cost Sharing, by Shahar Dobzinski and Shahar Ovadia SIGecom Doctoral Dissertation Award, by Peng Shi A separate SIGecom Best Paper with a Student Lead Author Award was not given as the SIGecom Best Paper Award was given to a paper that has a student lead author. To emphasize commonalities among the problems studied at EC, and to facilitate interchange at the conference, sessions were organized by topic rather than by focus area, and no indication of a paper's focus area(s) was given at the conference or appears in these proceedings. EC'17 featured the following invited plenary talks: Graphons: A Nonparametric Method to Model, Estimate, and Design Algorithms for Massive Networks, by Jennifer Chayes (Microsoft Research) Fair Algorithms for Machine Learning, by Michael Kearns (University of Pennsylvania) ACM SIGecom Test of Time Award: Truth Revelation in Approximately Efficient Combinatorial Auctions, by Daniel Lehmann, Liadan Ita O'Callaghan and Yoav Shoham (ACM EC 1999, Journal of the ACM 2002) In addition to the main technical program, EC'17 also featured four workshops: The 3rd Workshop on Algorithmic Game Theory and Data Science. Organizers: Jean Honorio, Denis Nekipelov, Renato Paes Leme, Yaron Singer, Vasilis Syrgkanis, and Elie Tamer Workshop on Mechanism Design for Social Good. Organizers: Rediet Abebe and Kira Goldner The 12th Workshop on the Economics of Networks, Systems and Computation (NetEcon) PC Chairs: Vincent Conitzer and Roche Guerin Forecasting Workshop. Organizers: Rafael Frongillo, David Rothschild, and Bo Waggoner five tutorials: Advances in Game Theory for Security and Privacy, presented by Bo An, Fei Fang, and Yevgeniy Vorobeychik An information Theoretical View of Information Elicitation Mechanisms, presented by Yuqing Kong and Grant Schoenebeck Bargaining, Trading, and Coordination in Networks: Theory and Challenges, presented by Benjamin Golub Incentivizing and Coordinating Exploration, presented by Robert Kleinberg and Aleksandrs Slivkins Pricing in Combinatorial Markets: Equilibria and Prophet Inequalities, presented by Michal Feldman and Brendan Lucier as well as a poster session in which 30 posters were presented.