Image de couverture de livre

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ron, Shiri, Thomas, Clayton, Weinberg, S. Matthew, Zhang, Qianfan
Format:	Preprint
Publié:	2024
Sujets:	Computer Science and Game Theory Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
par: Qiu, Frederick V., et autres
Publié: (2025)

Single-Item Auctions with a Monopolist Intermediary
par: Liu, Jingyi, et autres
Publié: (2026)

Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
par: Ganesh, Aadityan, et autres
Publié: (2025)

On the Computation of Equilibria in Discrete First-Price Auctions
par: Filos-Ratsikas, Aris, et autres
Publié: (2024)

Equilibrium Computation in First-Price Auctions with Correlated Priors
par: Filos-Ratsikas, Aris, et autres
Publié: (2025)

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
par: Chen, Xi, et autres
Publié: (2025)

Structural Complexities of Matching Mechanisms
par: Gonczarowski, Yannai A., et autres
Publié: (2022)

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
par: Kaczmarek, Joanna, et autres
Publié: (2024)

Complexity of Auctions with Interdependence
par: Loiseau, Patrick, et autres
Publié: (2026)

Strategyproofness-Exposing Descriptions of Matching Mechanisms
par: Gonczarowski, Yannai A., et autres
Publié: (2022)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
par: Aziz, Haris, et autres
Publié: (2024)

Efficient Equilibrium Computation in Symmetric First-Price Auctions
par: Filos-Ratsikas, Aris, et autres
Publié: (2026)

Equilibrium and Selfish Behavior in Network Contagion
par: Zhang, Yi, et autres
Publié: (2025)

Envy-Free House Allocation with Minimum Subsidy
par: Choo, Davin, et autres
Publié: (2024)

Revisiting the Primitives of Transaction Fee Mechanism Design
par: Ganesh, Aadityan, et autres
Publié: (2024)

Smoothed analysis of deterministic discounted and mean-payoff games
par: Loff, Bruno, et autres
Publié: (2024)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
par: D'Amico-Wong, Luca, et autres
Publié: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
par: Zhou, Aizhong, et autres
Publié: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
par: Gao, Ruiquan, et autres
Publié: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
par: Brânzei, Simina, et autres
Publié: (2024)

Committee Elections with Candidate Attribute Constraints
par: Zhou, Aizhong, et autres
Publié: (2024)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
par: Ghosh, Abheek, et autres
Publié: (2024)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
par: Bredereck, Robert, et autres
Publié: (2024)

Reforming an Unfair Allocation by Exchanging Goods
par: Yuen, Sheung Man, et autres
Publié: (2024)

Tight Inapproximability of Nash Equilibria in Public Goods Games
par: Dinh, Jérémi Do, et autres
Publié: (2024)

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
par: Bernasconi, Martino, et autres
Publié: (2024)

The Computational Complexity of the Housing Market
par: Lock, Edwin, et autres
Publié: (2024)

Persuading a Credible Agent
par: Gan, Jiarui, et autres
Publié: (2024)

On the Smoothed Complexity of Combinatorial Local Search
par: Giannakopoulos, Yiannis, et autres
Publié: (2022)

How to Resolve Envy by Adding Goods
par: Bentert, Matthias, et autres
Publié: (2025)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
par: Lin, Chuang-Chieh, et autres
Publié: (2023)

Constant Inapproximability for Fisher Markets
par: Deligkas, Argyrios, et autres
Publié: (2026)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
par: Hansen, Kristoffer Arnsfelt, et autres
Publié: (2025)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
par: Horn, Laryssa, et autres
Publié: (2025)

Modelling Network Resilience: The Complexity of Some Graph Division Games
par: Gutowski, Grzegorz, et autres
Publié: (2026)

Bribery's Influence on Ranked Aggregation
par: Jain, Pallavi, et autres
Publié: (2026)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
par: Anagnostides, Ioannis, et autres
Publié: (2025)

Constant Inapproximability for PPA
par: Deligkas, Argyrios, et autres
Publié: (2022)

Spatial Voting with Incomplete Voter Information
par: Imber, Aviram, et autres
Publié: (2023)

Efficiently Computing Equilibria in Budget-Aggregation Games
par: Becker, Patrick, et autres
Publié: (2025)