{"total":13,"rows":[{"id":"2202.13110","title":"Optimal-er Auctions through Attention","created":"2022-02-26","cited_by_count":27,"area":null},{"id":"2202.02872","title":"Differentiable Economics for Randomized Affine Maximizer Auctions","created":"2022-02-06","cited_by_count":22,"area":null},{"id":"2406.07428","title":"GemNet: Menu-Based, Strategy-Proof Multi-Bidder Auctions Through Deep Learning","created":"2024-06-11","cited_by_count":14,"area":null},{"id":"2310.20096","title":"Data Market Design through Deep Learning","created":"2023-10-31","cited_by_count":8,"area":null},{"id":"2502.10308","title":"LLM-Powered Preference Elicitation in Combinatorial Assignment","created":"2025-02-14","cited_by_count":8,"area":null},{"id":"2408.05686","title":"The Bandit Whisperer: Communication Learning for Restless Bandits","created":"2024-08-11","cited_by_count":5,"area":null},{"id":"2402.11904","title":"Automated Deterministic Auction Design with Objective Decomposition","created":"2024-02-19","cited_by_count":2,"area":null},{"id":"2412.00301","title":"Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives","created":"2024-11-30","cited_by_count":2,"area":null},{"id":"2303.00116","title":"Neural Auctions Compromise Bidder Information","created":"2023-02-28","cited_by_count":1,"area":null},{"id":"2506.22911","title":"Learning Truthful Mechanisms without Discretization","created":"2025-06-28","cited_by_count":1,"area":null},{"id":"2410.19384","title":"Learning Neural Strategy-Proof Matching Mechanism from Examples","created":"2024-10-25","cited_by_count":0,"area":null},{"id":"2501.01111","title":"Regularized Proportional Fairness Mechanism for Resource Allocation Without Money","created":"2025-01-02","cited_by_count":0,"area":null},{"id":"2605.03216","title":"MenuNet: A Strategy-Proof Mechanism for Matching Markets","created":"2026-05-04","cited_by_count":0,"area":null}],"next_cursor":null}