:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Gravin, Nick, Jia, Jianhao
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2502.08578
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
by: Gravin, Nick, et al.
Published: (2024)

Strategic Facility Location via Predictions
by: Chen, Qingyun, et al.
Published: (2024)

Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation
by: Gravin, Nickolai, et al.
Published: (2023)

Randomized learning-augmented auctions with revenue guarantees
by: Caragiannis, Ioannis, et al.
Published: (2024)

Truthful-in-Expectation Mechanisms for MMS Approximation
by: Babaioff, Moshe, et al.
Published: (2026)

Optimising expectation with guarantees for window mean payoff in Markov decision processes
by: Gaba, Pranshu, et al.
Published: (2025)

Approximately Optimal Mechanism Design for Competing Sellers
by: Lucier, Brendan, et al.
Published: (2025)

Evaluating the Performance of Approximation Mechanisms under Budget Constraints
by: Carbajal, Juan Carlos, et al.
Published: (2026)

Settling the Communication Complexity of VCG-based Mechanisms for all Approximation Guarantees
by: Qiu, Frederick V., et al.
Published: (2024)

On-demand Mobility-as-a-Service platform assignment games with guaranteed stable outcomes
by: Liu, Bingqing, et al.
Published: (2023)

A Control Theoretic Approach to Decentralized AI Economy Stabilization via Dynamic Buyback-and-Burn Mechanisms
by: Cheng, Zehua, et al.
Published: (2026)

Zero-sum turn games using Q-learning: finite computation with security guarantees
by: Anderson, Sean, et al.
Published: (2025)

When agents choose bundles autonomously: guarantees beyond discrepancy
by: Gupta, Sushmita, et al.
Published: (2026)

Approximating Electoral Control Problems
by: Bui, Huy Vu, et al.
Published: (2025)

Proportionally Fair Makespan Approximation
by: Feldman, Michal, et al.
Published: (2024)

Approximately Efficient Bilateral Trade with Samples
by: Deng, Yuan, et al.
Published: (2025)

Improved Approximate EFX Guarantees for Multigraphs
by: Kaviani, Alireza, et al.
Published: (2025)

Perpetual Fully-Online Approximate Fairness
by: Kahana, Ido, et al.
Published: (2026)

On the Approximability of the Yolk in the Spatial Model of Voting
by: Hu, Ran, et al.
Published: (2024)

Improving Approximation Guarantees for Maximin Share
by: Akrami, Hannaneh, et al.
Published: (2023)

Approximately EFX and PO Allocations for Bivalued Chores
by: Lin, Zehan, et al.
Published: (2025)

Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025)

Interdependent Bilateral Trade: Information vs Approximation
by: Dobzinski, Shahar, et al.
Published: (2025)

Contract Design Under Approximate Best Responses
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Approximating Gains-from-Trade in Matching Markets
by: Babaioff, Moshe, et al.
Published: (2026)

MMS Approximations Under Additive Leveled Valuations
by: Afshinmehr, Mahyar, et al.
Published: (2024)

On The Pursuit of EFX for Chores: Non-Existence and Approximations
by: Christoforidis, Vasilis, et al.
Published: (2024)

Dynamic Allocation of Public Goods with Approximate Core Equilibria
by: Onyeze, Chido, et al.
Published: (2025)

Constant-Approximate and Constant-Strategyproof Two-Facility Location
by: Fullerton, Elijah Journey, et al.
Published: (2025)

Approximability Landscape of Welfare Maximization within Fair Allocations
by: Bu, Xiaolin, et al.
Published: (2022)

Approximate-EFX Allocations with Ordinal and Limited Cardinal Information
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)

Multidimensional Bayesian Utility Maximization: Tight Approximations to Welfare
by: Goldner, Kira, et al.
Published: (2024)

NP-Hardness of Approximating Nash Social Welfare with Supermodular Valuations
by: Bebchuk, Alon
Published: (2025)

Approximating N-Player Nash Equilibrium through Gradient Descent
by: Wang, Dongge, et al.
Published: (2025)

Approximate Envy-Free Allocations up to any $k$ Goods
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Computational Aspects of Bayesian Persuasion under Approximate Best Response
by: Yang, Kunhe, et al.
Published: (2024)

Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line
by: Bhaskar, Umang, et al.
Published: (2024)

Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals
by: Leme, Renato Paes, et al.
Published: (2023)

Actively Learning to Coordinate in Convex Games via Approximate Correlated Equilibrium
by: Fang, Zhenlong, et al.
Published: (2025)