Portrait of Jiaxin Song

Jiaxin Song

PhD studentUniversity of Illinois
Urbana-Champaign

About

I am a PhD student at the University of Illinois Urbana-Champaign, advised by Prof. Bhaskar Ray Chaudhury. I work on computational economics and algorithmic game theory, with a side interest in program synthesis.

Previously, I received my bachelor’s degree in computer science from Shanghai Jiao Tong University in 2023, where I worked with Prof. Biaoshuai Tao on algorithmic game theory and Prof. Qinxiang Cao on formal methods. In summer 2024, I worked with Prof. Yu Feng on program synthesis.

You can reach me at jiaxins8@illinois.edu.

News

  • I’m joining Amazon as an Applied Scientist Intern in the Automated Reasoning group in San Jose, working on verification of IAM refinement.

  • I visited MIT this summer, working with Prof. Manish Raghavan and Prof. Kate Donahue.

  • Our data pricing paper was selected for an ICML 2026 oral presentation, and our online chores paper was accepted at EC 2026.

Selected publications

(α–β) indicates alphabetical author order. Other author lists follow contribution order.

ICML 2026oral

Equilibrium Pricing in Oligopolistic Data Markets

(α–β) Bhaskar Ray Chaudhury, Jugal Garg, Eklavya Sharma, Jiaxin Song

Paper
Summary

Exact Nash equilibria may fail to exist. The paper establishes a pricing profile where switching to a uniform price cannot improve any seller’s revenue by more than a factor of two.

View all publications

Full publications

(α–β) indicates alphabetical author order. Other author lists follow contribution order.

NeurIPS 2026

Non-Linear Pricing Restores Tractability for a Data Seller

(α–β) Bhaskar Ray Chaudhury, Jugal Garg, Eklavya Sharma, Jiaxin Song

NeurIPS 2026

The Stability of Data Exchange in Competitive Markets

Yuanchen Brian Tang, Jiaxin Song, Bhaskar Ray Chaudhury, Ruta Mehta

EC 2026

Online MMS Allocation for Chores

(α–β) Jiaxin Song, Biaoshuai Tao, Wenqian Wang, Yuhao Zhang

Paper
Summary

The general lower bound exactly matches the trivial n-MMS guarantee. Better bounds are possible when the number or range of distinct disutilities is limited.

ICML 2026oral

Equilibrium Pricing in Oligopolistic Data Markets

(α–β) Bhaskar Ray Chaudhury, Jugal Garg, Eklavya Sharma, Jiaxin Song

Paper
Summary

Exact Nash equilibria may fail to exist. The paper establishes a pricing profile where switching to a uniform price cannot improve any seller’s revenue by more than a factor of two.

ICML 2025

You Get What You Give: Reciprocally Fair Federated Learning

Aniket Murhekar, Jiaxin Song, Parnian Shahkar, Bhaskar Ray Chaudhury, Ruta Mehta

PaperCode
Summary

Under the paper’s assumptions, the mechanism admits Nash equilibria and aligns agents’ payoffs with their contributions. The analysis and experiments also examine improvements in accuracy, welfare, and data sharing.

SBC 2025

Tessel: An Optimizing Compiler for Efficient Zero-Knowledge Circuits

Junrui Liu, Jiaxin Song, Yanning Chen, Hanzhi Liu, Hongbo Wen, Yanju Chen, Yu Feng

Experience

  1. Amazon

    Applied Scientist Intern · Automated Reasoning group · San Jose

    Verification of IAM refinement.

  2. MIT

    Research visit

    Worked with Prof. Manish Raghavan and Prof. Kate Donahue.

  3. UC Santa Barbara

    Research collaboration · Program synthesis

    Worked with Prof. Yu Feng, Hongbo Wen, Junrui Liu, and Yanju Chen.

Service

PC
AAAI 2026, EC 2026, NeurIPS 2026, NeurIPS AI for Verifiable Coding Workshop 2026, AAAI 2027
AE PC
CCS'25

Terminal

Enter to run · ↑↓ history · Esc to close