Imagen de Portada

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Eden, Alon, Feldman, Michal, Mauras, Simon, Mohan, Divyarthi
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Combinatorial Allocation with Interdependent Values
por: Feldman, Michal, et al.
Publicado: (2025)

Optimal Stopping with Interdependent Values
por: Mauras, Simon, et al.
Publicado: (2024)

Complexity of Auctions with Interdependence
por: Loiseau, Patrick, et al.
Publicado: (2026)

Truthful Matching with Online Items and Offline Agents
por: Feldman, Michal, et al.
Publicado: (2022)

Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
por: Ganesh, Aadityan, et al.
Publicado: (2025)

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
por: Ezra, Tomer, et al.
Publicado: (2024)

Prophet Upper Bounds for Online Matching and Auctions
por: Soto, José, et al.
Publicado: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

Online Matroid Embeddings
por: Cristi, Andrés, et al.
Publicado: (2024)

Sample Complexity of Posted Pricing for a Single Item
por: Jin, Billy, et al.
Publicado: (2024)

Pandora's Problem with Combinatorial Cost
por: Berger, Ben, et al.
Publicado: (2023)

Laminar Matroid Secretary: Greedy Strikes Back
por: Huang, Zhiyi, et al.
Publicado: (2023)

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
por: Bilò, Vittorio, et al.
Publicado: (2025)

A Strongly Polynomial Algorithm for Arctic Auctions
por: Garg, Jugal, et al.
Publicado: (2026)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
por: Feng, Yuda, et al.
Publicado: (2024)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
por: Kawase, Yasushi, et al.
Publicado: (2023)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
por: Inamdar, Tanmay, et al.
Publicado: (2026)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
por: Charalampopoulos, Andreas, et al.
Publicado: (2026)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
por: Feng, Yuda, et al.
Publicado: (2024)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
por: Bei, Xiaohui, et al.
Publicado: (2025)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
por: Charalampopoulos, Andreas, et al.
Publicado: (2025)

Prophet Secretary and Matching: the Significance of the Largest Item
por: Chen, Ziyun, et al.
Publicado: (2024)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
por: Andersen, Martin Jupakkal, et al.
Publicado: (2025)

On the Correlation Gap of Matroids
por: Husić, Edin, et al.
Publicado: (2022)

Pandora's Box Problem With Time Constraints
por: Amanatidis, Georgios, et al.
Publicado: (2024)

Weighted Envy Freeness With Bounded Subsidies
por: Elmalem, Noga Klein, et al.
Publicado: (2024)

Risk-Sensitive Online Selection with Bounded Adaptivity
por: Nekouyan, Hossein, et al.
Publicado: (2025)

A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
por: Akrami, Hannaneh, et al.
Publicado: (2026)

Online Combinatorial Allocations and Auctions with Few Samples
por: Dütting, Paul, et al.
Publicado: (2024)

Strategizing against No-Regret Learners in First-Price Auctions
por: Rubinstein, Aviad, et al.
Publicado: (2024)

Procurement Auctions via Approximately Optimal Submodular Optimization
por: Deng, Yuan, et al.
Publicado: (2024)

Optimal Single-Choice Prophet Inequalities from Samples
por: Rubinstein, Aviad, et al.
Publicado: (2019)

Static Pricing for Single Sample Multi-unit Prophet Inequalities
por: Nuti, Pranav, et al.
Publicado: (2024)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection
por: Caramanis, Constantine, et al.
Publicado: (2021)

Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs
por: Vazirani, Vijay V.
Publicado: (2025)

Combinatorial Pen Testing (or Consumer Surplus of Deferred-Acceptance Auctions)
por: Ganesh, Aadityan, et al.
Publicado: (2023)

Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
por: Bullinger, Martin, et al.
Publicado: (2025)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
por: Golrezaei, Negin, et al.
Publicado: (2024)

Bipartiteness in Progressive Second-Price Multi-Auction Networks with Perfect Substitute
por: Blazek, Jordana, et al.
Publicado: (2025)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
por: Kevi, Eniko, et al.
Publicado: (2024)