Abstract is missing.
- Stable Dinner Party Seating ArrangementsDamien Berriaud, Andrei Constantinescu 0001, Roger Wattenhofer. 3-20 [doi]
- Buy-Many Mechanisms for Many Unit-Demand BuyersShuchi Chawla 0001, Rojin Rezvan, Yifeng Teng, Christos Tzamos. 21-38 [doi]
- Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible AgentsGeorgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis. 41-58 [doi]
- High-Welfare Matching Markets via Descending PriceRobin Bowers, Bo Waggoner. 59-76 [doi]
- Fair Division with Allocator's PreferenceXiaolin Bu, Zihao Li, Shengxin Liu, Jiaxin Song, Biaoshuai Tao. 77-94 [doi]
- Optimal Stopping with Multi-dimensional Comparative Loss AversionLinda Cai, Joshua Gardner, S. Matthew Weinberg. 95-112 [doi]
- Selling to Multiple No-Regret BuyersLinda Cai, S. Matthew Weinberg, Evan Wildenhain, Shirley Zhang. 113-129 [doi]
- Penalties and Rewards for Fair Learning in Paired Kidney Exchange ProgramsMargarida Carvalho, Alison Caulfield, Yi Lin, Adrian Vetta. 130-150 [doi]
- Deterministic Impartial Selection with WeightsJavier Cembrano, Svenja M. Griesbach, Maximilian J. Stahlberg. 151-168 [doi]
- Blockchain Participation GamesPyrros Chaidos, Aggelos Kiayias, Evangelos Markakis. 169-187 [doi]
- Recovering Single-Crossing Preferences from Approval BallotsAndrei Constantinescu 0001, Roger Wattenhofer. 188-206 [doi]
- The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular PreferencesCyrus Cousins, Vignesh Viswanathan, Yair Zick. 207-224 [doi]
- Dividing Good and Great Items Among Agents with Bivalued Submodular ValuationsCyrus Cousins, Vignesh Viswanathan, Yair Zick. 225-241 [doi]
- Equilibrium Analysis of Customer Attraction GamesXiaotie Deng, Ningyuan Li, Weian Li, Qi Qi 0003. 242-255 [doi]
- The Importance of Knowing the Arrival Order in Combinatorial Bayesian SettingsTomer Ezra, Tamar Garbuz. 256-271 [doi]
- Prophet Inequalities via the Expected Competitive RatioTomer Ezra, Stefano Leonardi 0001, Rebecca Reiffenhäuser, Matteo Russo, Alexandros Tsigonias-Dimitriadis. 272-289 [doi]
- Smoothed Analysis of Social Choice RevisitedBailey Flanigan, Daniel Halpern 0002, Alexandros Psomas 0001. 290-309 [doi]
- A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on TreesGanesh Ghalme, Xin Huang, Yuka Machino, Nidhi Rathi. 310-328 [doi]
- A Mechanism for Participatory Budgeting with Funding Constraints and Project InteractionsMohak Goyal, Sahasrajit Sarmasarkar, Ashish Goel. 329-347 [doi]
- Randomized Algorithm for MPMD on Two SourcesKun He 0001, Sizhe Li, Enze Sun, Yuyi Wang, Roger Wattenhofer, Weihao Zhu. 348-365 [doi]
- Polyhedral Clinching Auctions for Indivisible GoodsHiroshi Hirai 0001, Ryosuke Sato 0002. 366-383 [doi]
- Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear ProgramsZhiyi Huang 0002, Hanrui Jiang, Aocheng Shen, Junkai Song, Zhiang Wu 0003, Qiankun Zhang. 384-401 [doi]
- Online Nash Welfare Maximization Without PredictionsZhiyi Huang 0002, Minming Li, Xinkai Shu, Tianze Wei. 402-419 [doi]
- The Price of Anarchy of Probabilistic Serial in One-Sided Allocation ProblemsSissi Jiang, Ndiamé Ndiaye, Adrian Vetta, Eggie Wu. 420-437 [doi]
- An Adaptive and Verifiably Proportional Method for Participatory BudgetingSonja Kraiczy, Edith Elkind. 438-455 [doi]
- Routing MEV in Constant Function Market MakersKshitij Kulkarni, Theo Diamandis, Tarun Chitra. 456-473 [doi]
- Auction Design for Value Maximizers with Budget and Return-on-Spend ConstraintsPinyan Lu, Chenyang Xu 0002, Ruilong Zhang 0001. 474-491 [doi]
- Auction Design for Bidders with Ex Post ROI ConstraintsHongtao Lv, Xiaohui Bei, Zhenzhe Zheng, Fan Wu 0006. 492-508 [doi]
- Nash Stability in Fractional Hedonic Games with Bounded Size CoalitionsGianpiero Monaco, Luca Moscardelli. 509-526 [doi]
- Improved Competitive Ratio for Edge-Weighted Online Stochastic MatchingGuoliang Qiu 0001, Yilong Feng, Shengwei Zhou 0002, Xiaowei Wu 0001. 527-544 [doi]
- Separation in Distributionally Robust Monopolist ProblemHao Qiu, Zhen Wang, Simai He. 545-562 [doi]
- Target-Oriented Regret Minimization for Satisficing MonopolistsNapat Rujeerapaiboon, Yize Wei, Yilin Xue. 563-581 [doi]
- One Quarter Each (on Average) Ensures ProportionalityXiaowei Wu 0001, Cong Zhang 0008, Shengwei Zhou 0002. 582-599 [doi]
- Two-Sided Capacitated Submodular Maximization in Gig PlatformsPan Xu. 600-617 [doi]
- Price Cycles in Ridesharing PlatformsChenkai Yu, Hongyao Ma, Adam Wierman. 618-636 [doi]
- Improved Truthful Rank Approximation for Rank-Maximal MatchingsJinshan Zhang 0001, Zhengyang Liu 0002, Xiaotie Deng, Jianwei Yin. 637-653 [doi]
- Reallocation Mechanisms Under Distributional Constraints in the Full Preference DomainJinshan Zhang 0001, Bo Tang 0010, Xiaoye Miao, Jianwei Yin. 654-671 [doi]