Post-conference Update: Video recordings from the EC main conference are now online!
The workshops and tutorials will be on June 26-27, and the main technical program will be on June 28-30. Lunch will be provided by the conference.
Complete PDF Schedule for Workshops, Tutorials and Main Conference is here!
Tuesday, June 27, 2017 | |
6:00 - 8:00 PM |
Reception and Poster Session (Location: Stata 4th floor lounge) |
Wednesday, June 28, 2017 | |
8:00 - 9:00 AM |
Breakfast |
9:00 - 9:15 AM |
Opening Remarks |
9:15 - 10:15 AM |
Plenary Session (Location: 32-123)
Michael Kearns (University of Pennsylvania) |
10:15 - 10:40 AM |
Coffee |
10:40 AM - 12:00 PM | Session 1a
Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison
Deferred-Acceptance Auctions for Multiple Levels of Service
The Optimal Mechanism for Selling to a Budget Constrained Buyer: the General Case
Optimal Multi-Unit Mechanisms with Private Demands
Session 1b
The Double Clinching Auction for Wagering
Forecast Aggregation
Machine-Learning Aided Peer Prediction
Peer Prediction with Heterogeneous Users
|
12:00 - 1:30 PM |
Lunch |
1:10 - 2:30 PM |
Business Meeting (Location: 32-123) |
2:40 - 4:00 PM |
Session 2a
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm
Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions
Matching while Learning
Redesigning the Israeli Psychology Master's Match
Session 2b
A "Quantal Regret" Method for Structural Econometrics in Repeated Games
The Theory is Predictive, but is it Complete? An Application to Human Perception of Randomness
Comparison-based Choices
Combinatorial Auctions Do Need Modest Interaction
|
4:00 - 4:30 PM |
Coffee |
4:30 - 5:50 PM |
Session 3a
The Scope of Sequential Screening with Ex Post Participation Constraints
Dynamic Mechanisms with Martingale Utilities
Repeated Sales with Multiple Strategic Buyers
Posted Price Mechanisms for a Random Stream of Customers
Session 3b
Accounting for Strategic Response in an Agent-Based Model of Financial Regulation
Empirical Mechanism Design for Optimizing Clearing Interval in Frequent Call Markets
Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation
Surge Pricing Solves the Wild Goose Chase
|
6:00 - 7:00 PM |
Open discussion on job market advice for graduate students (Location: 32-123) lead by Kevin Leyton-Brown, Ruta Mehta and Matt Weinberg |
Thursday, June 29, 2017 | |
8:00 - 9:00 AM |
Breakfast |
9:00 - 10:20 AM |
Session 4a
Stable Secretaries
Computing Equilibrium in Matching Markets
Communication Requirements and Informative Signaling in Matching Markets
Complementary Inputs and the Existence of Stable Outcomes in Large Trading Networks
Session 4b
Making Right Decisions Based on Wrong Opinions
Voting in the Limelight
Metric Distortion of Social Choice Rules
Of the People: Voting Is More Effective with Representative Candidates
|
10:20 - 10:50 AM |
Coffee |
10:50 AM - 12:10 PM |
Session 5a
A Simple and Approximately Optimal Mechanism for a Buyer with Complements
Price Doubling and Item Halving: Robust Revenue Guarantees for Item Pricing
The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders
Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
Session 5b
Optimal Signaling Mechanisms in Unobservable Queues with Strategic Customers
Information Sharing and Privacy in Networks
Algorithmic Persuasion with No Externalities
Fairness Incentives for Myopic Agents
|
12:10 - 1:40 PM |
Lunch |
1:40 - 2:40 PM |
Best paper and Best Dissertation presentations (Location: 32-123)
Combinatorial Cost Sharing
SIGecom Doctoral Dissertation Award presentation by Peng Shi |
2:50 - 3:50 PM |
Session 6a
Makespan Minimization via Posted Prices
Truth and Regret in Online Scheduling
Cost-Sharing Methods for Scheduling Games under Uncertainty
Session 6b
Convex Program Duality, Fisher Markets, and Nash Social Welfare
Controlled Dynamic Fair Division
A Lower Bound for Equitable Cake Cutting
|
3:50 - 4:20 PM |
Coffee |
4:20 - 5:40 PM |
Session 7a
Online Auctions and Multi-scale Online Learning
Joint Pricing and Inventory Management with Strategic Customers
Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework
Multidimensional Dynamic Pricing for Welfare Maximization
Session 7b
The Tragedy of your Upstairs Neighbors: Is the Negative Externality of Airbnb Internalized?
Interacting User Generated Content Technologies: How Q&As Affect Ratings & Reviews
Learning in the Repeated Secretary Problem
Diffusion in Networks and the Unexpected Virtue of Burstiness
|
6:00 - 9:00 PM |
EC Social Event: Reception hosted by Microsoft Location: Microsoft NERD Center, One Memorial Drive |
Friday, June 30, 2017 | |
8:00 - 9:00 AM |
Breakfast |
9:00 - 10:00 AM |
Session 8a
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness
From Monetary to Non-Monetary Mechanism Design via Artificial Currencies
Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness
Session 8b
Planning with Multiple Biases
Multidimensional Binary Search for Contextual Decision-Making
Bifurcation Mechanism Design - from Optimal Flat Taxes to Improved Cancer Treatments
|
10:00 - 10:20 AM |
Coffee |
10:20 - 11:20 AM |
Session 9a
Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms
Approximately Efficient Two-Sided Combinatorial Auctions
Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium
Session 9b
Nash Social Welfare Approximation for Strategic Agents
Fair Public Decision Making
Approximation Algorithms for Maximin Fair Division
|
11:30 AM - 12:30 PM |
Plenary Session (Location: 32-123)
Jennifer Chayes (Microsoft Research) |
12:30 - 2:00 PM |
Lunch |
2:00 - 3:20 PM |
Session 10a
Stability, Strategy-Proofness, and Cumulative Offer Mechanisms
Stable Matching with Proportionality Constraints
Making it Safe to Use Centralized Markets: Epsilon-Dominant Individual Rationality and Applications to Market Design
How (Not) to Allocate Affordable Housing
Session 10b
Simple Approximate Equilibria in Games with Many Players
Theoretical and Practical Advances on Smoothing for Extensive-Form Games
A Network Game of Dynamic Traffic
A Polynomial Time Algorithm For Spatio-Temporal Security Games
|
3:20 - 3:45 PM |
Coffee |
3:45 - 4:30 PM |
ACM SIGecom Test of Time Award (Location: 32-123) |