Settling the Communication Complexity of VCG-based Mechanisms for all Approximation Guarantees
Fuente:
arXiv
Guardado en:
| Autores principales: | Qiu, Frederick V., Weinberg, S. Matthew |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
por: Qiu, Frederick V., et al.
Publicado: (2025)
por: Qiu, Frederick V., et al.
Publicado: (2025)
Competition Complexity in Multi-Item Auctions: Beyond VCG and Regularity
por: Beyhaghi, Hedyeh, et al.
Publicado: (2025)
por: Beyhaghi, Hedyeh, et al.
Publicado: (2025)
Settling the Competition Complexity of Additive Buyers over Independent Items
por: Derakhshan, Mahsa, et al.
Publicado: (2024)
por: Derakhshan, Mahsa, et al.
Publicado: (2024)
A VCG-based Fair Incentive Mechanism for Federated Learning
por: Cong, Mingshu, et al.
Publicado: (2020)
por: Cong, Mingshu, et al.
Publicado: (2020)
Eliciting Truthful Feedback for Preference-Based Learning via the VCG Mechanism
por: Landolt, Leo, et al.
Publicado: (2025)
por: Landolt, Leo, et al.
Publicado: (2025)
Truthful and Trustworthy IoT AI Agents via Immediate-Penalty Enforcement under Approximate VCG Mechanisms
por: Shao, Xun, et al.
Publicado: (2025)
por: Shao, Xun, et al.
Publicado: (2025)
An Enhanced Dual-Currency VCG Auction Mechanism for Resource Allocation in IoV: A Value of Information Perspective
por: Wang, Wei, et al.
Publicado: (2025)
por: Wang, Wei, et al.
Publicado: (2025)
Settling the Complexity of Popularity in Additively Separable and Fractional Hedonic Games
por: Bullinger, Martin, et al.
Publicado: (2024)
por: Bullinger, Martin, et al.
Publicado: (2024)
Improved Approximate EFX Guarantees for Multigraphs
por: Kaviani, Alireza, et al.
Publicado: (2025)
por: Kaviani, Alireza, et al.
Publicado: (2025)
Improving Approximation Guarantees for Maximin Share
por: Akrami, Hannaneh, et al.
Publicado: (2023)
por: Akrami, Hannaneh, et al.
Publicado: (2023)
Revisiting the Primitives of Transaction Fee Mechanism Design
por: Ganesh, Aadityan, et al.
Publicado: (2024)
por: Ganesh, Aadityan, et al.
Publicado: (2024)
Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
por: Ron, Shiri, et al.
Publicado: (2024)
por: Ron, Shiri, et al.
Publicado: (2024)
Analyzing the Economic Impact of Decentralization on Users
por: Levy, Amit, et al.
Publicado: (2025)
por: Levy, Amit, et al.
Publicado: (2025)
Selfish Mining under General Stochastic Rewards
por: Bahrani, Maryam, et al.
Publicado: (2025)
por: Bahrani, Maryam, et al.
Publicado: (2025)
Characterizing Off-Chain Influence Proof Transaction Fee Mechanisms
por: Ganesh, Aadityan, et al.
Publicado: (2025)
por: Ganesh, Aadityan, et al.
Publicado: (2025)
Fairness under Equal-Sized Bundles: Impossibility Results and Approximation Guarantees
por: Mancho, Alviona, et al.
Publicado: (2025)
por: Mancho, Alviona, et al.
Publicado: (2025)
Optimal RANDAO Manipulation in Ethereum
por: Alpturer, Kaya, et al.
Publicado: (2024)
por: Alpturer, Kaya, et al.
Publicado: (2024)
Settling the Score: Portioning with Cardinal Preferences
por: Elkind, Edith, et al.
Publicado: (2023)
por: Elkind, Edith, et al.
Publicado: (2023)
Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores
por: Qiu, Jiawei, et al.
Publicado: (2024)
por: Qiu, Jiawei, et al.
Publicado: (2024)
Truthful-in-Expectation Mechanisms for MMS Approximation
por: Babaioff, Moshe, et al.
Publicado: (2026)
por: Babaioff, Moshe, et al.
Publicado: (2026)
Single-Item Auctions with a Monopolist Intermediary
por: Liu, Jingyi, et al.
Publicado: (2026)
por: Liu, Jingyi, et al.
Publicado: (2026)
Approximately Optimal Mechanism Design for Competing Sellers
por: Lucier, Brendan, et al.
Publicado: (2025)
por: Lucier, Brendan, et al.
Publicado: (2025)
Adversarial procurement in blockchains
por: Bahrani, Maryam, et al.
Publicado: (2026)
por: Bahrani, Maryam, et al.
Publicado: (2026)
Evaluating the Performance of Approximation Mechanisms under Budget Constraints
por: Carbajal, Juan Carlos, et al.
Publicado: (2026)
por: Carbajal, Juan Carlos, et al.
Publicado: (2026)
Approximation guarantees of Median Mechanism in $\mathbb{R}^d$
por: Gravin, Nick, et al.
Publicado: (2025)
por: Gravin, Nick, et al.
Publicado: (2025)
Revenue Guarantees in Autobidding Platforms
por: Caragiannis, Ioannis, et al.
Publicado: (2026)
por: Caragiannis, Ioannis, et al.
Publicado: (2026)
Profitable Manipulations of Cryptographic Self-Selection are Statistically Detectable
por: Cai, Linda, et al.
Publicado: (2024)
por: Cai, Linda, et al.
Publicado: (2024)
Utilitarian Guarantees for the Method of Equal Shares
por: Baychkov, Anton, et al.
Publicado: (2025)
por: Baychkov, Anton, et al.
Publicado: (2025)
Proportionally Fair Makespan Approximation
por: Feldman, Michal, et al.
Publicado: (2024)
por: Feldman, Michal, et al.
Publicado: (2024)
The Complexity of Tullock Contests
por: He, Yu, et al.
Publicado: (2024)
por: He, Yu, et al.
Publicado: (2024)
Ordinal Maximin Guarantees for Group Fair Division
por: Manurangsi, Pasin, et al.
Publicado: (2024)
por: Manurangsi, Pasin, et al.
Publicado: (2024)
Improved Maximin Share Guarantee for Additive Valuations
por: Heidari, Ehsan, et al.
Publicado: (2025)
por: Heidari, Ehsan, et al.
Publicado: (2025)
Robust Temporal Guarantees in Budgeted Sequential Auctions
por: Fikioris, Giannis, et al.
Publicado: (2026)
por: Fikioris, Giannis, et al.
Publicado: (2026)
Revenue Maximization Mechanisms for an Uninformed Mediator with Communication Abilities
por: Fan, Zhikang, et al.
Publicado: (2024)
por: Fan, Zhikang, et al.
Publicado: (2024)
Optimal Single-Choice Prophet Inequalities from Samples
por: Rubinstein, Aviad, et al.
Publicado: (2019)
por: Rubinstein, Aviad, et al.
Publicado: (2019)
Beyond Proportional Individual Guarantees for Binary Perpetual Voting
por: Gafni, Yotam, et al.
Publicado: (2024)
por: Gafni, Yotam, et al.
Publicado: (2024)
Impartial Selection with Additive Guarantees via Iterated Deletion
por: Cembrano, Javier, et al.
Publicado: (2022)
por: Cembrano, Javier, et al.
Publicado: (2022)
Achieving EF1 and Epistemic EFX Guarantees Simultaneously
por: Akrami, Hannaneh, et al.
Publicado: (2026)
por: Akrami, Hannaneh, et al.
Publicado: (2026)
Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
por: Akrami, Hannaneh, et al.
Publicado: (2026)
por: Akrami, Hannaneh, et al.
Publicado: (2026)
Maximin Share Guarantees for Few Agents with Subadditive Valuations
por: Christodoulou, George, et al.
Publicado: (2025)
por: Christodoulou, George, et al.
Publicado: (2025)
Ejemplares similares
-
The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
por: Qiu, Frederick V., et al.
Publicado: (2025) -
Competition Complexity in Multi-Item Auctions: Beyond VCG and Regularity
por: Beyhaghi, Hedyeh, et al.
Publicado: (2025) -
Settling the Competition Complexity of Additive Buyers over Independent Items
por: Derakhshan, Mahsa, et al.
Publicado: (2024) -
A VCG-based Fair Incentive Mechanism for Federated Learning
por: Cong, Mingshu, et al.
Publicado: (2020) -
Eliciting Truthful Feedback for Preference-Based Learning via the VCG Mechanism
por: Landolt, Leo, et al.
Publicado: (2025)