Workshop at EC'26 · Rome, Italy · July 6, 2026

Easy Peasy at EC.

A workshop on proofs and results so elegant, surprising, or delightfully clean that every AGT researcher should know them.

Conference EC'26 — ACM Economics & Computation
Location Rome, Italy
Date July 6, 2026
Time 14:00 - 17:30
Workshop today! Join us in Room B at the Auditorium Antonianum. Registration required ("Only workshops" option available). For more details, see the EC website.
01 — About

Easy Peasy at EC aims to incentivize new work, highlight existing work, and aggregate proofs and ideas so surprising, illuminating, or delightfully clean that every AGT researcher should know them.

In the spirit of Erdős's Proofs from the Book and the SOSA conference, we seek results whose elegance reveals deeper structure — the kind of proof that makes you put down your pen and think "oh, that's the right way to see it."

A result belongs here if a good researcher, on seeing it, wishes they had known it sooner, or if it is so crisp and self-contained that you could drop it into a lecture and have students walk away understanding exactly why it's true.

02 — Program

Workshop program.

14:00

15:30
01
Calibeating Made Simple Paper ↗
Yurong Chen, Zhiyi Huang, Michael I. Jordan, Haipeng Luo
02
Learning a Game by Paying the Agents Paper ↗
Brian Hu Zhang, Tao Lin, Yiling Chen, Tuomas Sandholm
03
Why Fairness Objectives Collapse on the Budget Simplex Paper ↗
Meryem Essaidi
04
Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously Paper ↗
Hannaneh Akrami, Nidhi Rathi
05
An Entropy Potential for Type-Composition Games Paper ↗
Morteza Alimi, Merlin de la Haye, Pascal Lenzner, Šimon Schierreich, Alexander Skopalik, Marcus Wunderlich
15:30

16:00
Coffee Break
16:00

17:30
06
A Geometric Analysis of Gains from Trade Paper ↗
Jason Hartline, Kangning Wang
07
Bounded Best Buyers: Prophet Inequalities Revisited Paper ↗
Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrak
08
Prophet Inequality from Samples Paper ↗
Tomer Ezra
09
Magicians Don't Move: An Easy Peasy OCRS Paper ↗
Mohammad Reza Aminian, Rad Niazadeh, Pranav Nuti
10
A Match Made by Entropy Paper ↗
Mohammad Reza Aminian, Rad Niazadeh, Pranav Nuti
17:30

18:30
Poster Session (Auditorium Lobby)
03 — Topics

All areas of EconCS welcome.

  • Agent-based modeling
  • Algorithmic fairness and data privacy
  • Auctions and pricing
  • Behavioral economics and bounded rationality
  • Blockchain and cryptocurrencies
  • Contract design
  • Crowdsourcing and information elicitation
  • Decision theory
  • Econometrics
  • Economic aspects of learning algorithms
  • Economic aspects of neural networks and LLMs
  • Equilibrium analysis, incl. price of anarchy
  • Equilibrium computation and complexity
  • Fair division
  • Industrial organization
  • Information design
  • Laboratory and field experiments
  • Market design and matching markets
  • Market equilibria
  • Mechanism design
  • Online algorithms
  • Online platforms and applications
  • Social good and ethics
  • Social choice and voting theory
  • Social networks and social learning
04 — Submission

Call for papers.

Brief and self-contained

Submissions should contain only their elegant, simple result(s). The full result must be presentable in a 15-minute talk. Page limit: 10 pages, appropriately tailored to contain only your simple result(s), with anonymous authors.

New or previously published

We welcome both new and existing results. Examples: a new simple proof for a well-known result (like the economic proof of KVV), a new elegant result (like the single-sample geometric proof), or an elegant proof for a special case of a longer paper. The only exclusion is results already canonical in course curricula or folklore well-known to the community. All EconCS topics are encouraged, with priority given to newer, lesser-known, or more significant results.

Review process

Given that some works will be special cases of prior work we do not expect authors to fully anonymize the submission. But we require the submission to not have author names and affiliations. Submissions will be reviewed by a mixed-seniority program committee. The guiding philosophy: if a result is truly simple, a junior PhD student should be able to understand it.

No proceedings — papers posted publicly

There will be no published proceedings. Accepted authors are required to post their papers online (arXiv, SSRN, personal website, or equivalent). All accepted papers will be linked via a public index as a community resource. Dual submission to EC or any other conference is permitted.

Submission details

Platform
OpenReview

Submissions managed through OpenReview:

All authors are required to have an OpenReview profile. If creating a new OpenReview profile please use an institutional email for immediate approval.

Format
10 pages limit. Anoymous authors.

Tailored appropriately for this workshop--not a reprint of a longer paper--with "Anoymous author(s)".

Dual submission
Permitted

Dual submission to EC or any other venue is welcome.

05 — Dates

Important dates.

  • Submission Deadline May 4, 2026 · AoE
  • Notification of Acceptance May 24, 2026
  • EC'26 Early Registration Deadline May 29, 2026
  • Workshop at EC'26 · Rome July 6, 2026

The submission deadline falls before the EC notification date. Notifications will be sent early to allow authors to make travel arrangements and meet the EC early registration deadline.

06 — Organizers

Organizers.

Kira Goldner

Boston University, USA

Taylor Lundy

University of British Columbia, Canada

Divyarthi Mohan

Columbia University, USA
07 — Program Committee

Program committee.

Aadityan Ganesh
Princeton University
Abheek Ghosh
Technical University of Munich
Abdellah Aznag
Columbia University
Alireza AmaniHamedani
London Business School and Imperial College London
Anh Phung
Boston University
Aniket Murhekar
Northwestern University
Ariel Shaulker
Hebrew University of Jerusalem
Aviv Yaish
Yale University
Ce Li
Boston University
Daniel Schoepflin
Rutgers University -- DIMACS
Eric Xue
Princeton University
Giannis Fikioris
Cornell University
Giorgos Papasotiropoulos
University of Warsaw
Greg D'eon
University of British Columbia
Jingyi Liu
Princeton University
Johannes Brustle
Sapienza University of Rome
Kalen Patton
Georgia Institute of Technology
Kaya Ito Alpturer
Princeton University
Konstantin Zabarnyi
Yale University
Kunhe Yang
UC Berkeley
Maya Schlesinger
Tel Aviv University
Maxwell Fishelson
MIT/IAS
Narun Raman
University of British Columbia
Robin Bowers
University of Colorado, Boulder
Shaul Rosner
Tel Aviv University
Shengwei Xu
University of Michigan
Shiri Ron
Tel Aviv University
Stephen Newman
Princeton University
Suho Shin
University of Maryland
Sumit Goel
NYU Abu Dhabi
Thodoris Tsilivis
Boston University
Tomasz Ponitka
Tel Aviv University
Wenxin Zhang
Columbia University
Yichi Zhang
Rutgers University -- DIMACS
Yifan Wang
Georgia Institute of Technology
Yifan Wu
Microsoft Research New England
Yoav Gal-Tzur
Tel Aviv University
Yotam Gafni
Weizmann Institute of Science

Show us your
most elegant proof.

Deadline: May 4, 2026 (AoE) · Submissions via OpenReview