Imagen de Portada

Platforms for Efficient and Incentive-Aware Collaboration

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Haghtalab, Nika, Qiao, Mingda, Yang, Kunhe
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory Data Structures and Algorithms Multiagent Systems
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Leakage-Robust Bayesian Persuasion
por: Haghtalab, Nika, et al.
Publicado: (2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments
por: Chaudhary, Juhi, et al.
Publicado: (2024)

Equilibria in multiagent online problems with predictions
por: Istrate, Gabriel, et al.
Publicado: (2024)

EFX Exists for Three Types of Agents
por: HV, Vishwa Prakash, et al.
Publicado: (2024)

Reducing Leximin Fairness to Utilitarian Optimization
por: Hartman, Eden, et al.
Publicado: (2024)

Improved MMS Approximations for Few Agent Types
por: Garg, Jugal, et al.
Publicado: (2025)

Maximizing Value in Challenge the Champ Tournaments
por: Bhaskar, Umang, et al.
Publicado: (2025)

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
por: Kulkarni, Pooja, et al.
Publicado: (2025)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
por: Hartman, Eden, et al.
Publicado: (2025)

Group Fair Matchings using Convex Cost Functions
por: Panda, Atasi, et al.
Publicado: (2025)

Smooth Nash Equilibria: Algorithms and Complexity
por: Daskalakis, Constantinos, et al.
Publicado: (2023)

Learning in Stackelberg Games with Non-myopic Agents
por: Haghtalab, Nika, et al.
Publicado: (2022)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
por: Csáji, Gergely
Publicado: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
por: Csáji, Gergely
Publicado: (2023)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
por: Hummel, Halvard, et al.
Publicado: (2024)

Truthfulness of Calibration Measures
por: Haghtalab, Nika, et al.
Publicado: (2024)

Near-Feasible Stable Matchings: Incentives and Optimality
por: Glitzner, Frederik
Publicado: (2026)

Incentivizing Exploration with Selective Data Disclosure
por: Immorlica, Nicole, et al.
Publicado: (2018)

Revisiting Fair and Efficient Allocations for Bivalued Goods
por: Liu, Hui, et al.
Publicado: (2026)

Efficient Two-Sided Markets with Limited Information
por: Dütting, Paul, et al.
Publicado: (2020)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
por: Borst, Sander, et al.
Publicado: (2026)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
por: Segev, Danny, et al.
Publicado: (2020)

On the Parameterized Complexity of Controlling Amendment and Successive Winners
por: Yang, Yongjie
Publicado: (2025)

On the Complexity of the Two-Stage Majoritarian Rule
por: Yang, Yongjie
Publicado: (2023)

Sample-Adaptivity Tradeoff in On-Demand Sampling
por: Haghtalab, Nika, et al.
Publicado: (2025)

Pairwise Exchanges of Freely Replicable Goods with Negative Externalities
por: Yang, Shangyuan, et al.
Publicado: (2026)

Constant Approximation for Weighted Nash Social Welfare with Submodular 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)

Distortion of AI Alignment: Does Preference Optimization Optimize for Preferences?
por: Gölz, Paul, et al.
Publicado: (2025)

Matching with Nested and Bundled Pandora Boxes
por: Bowers, Robin, et al.
Publicado: (2024)

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

Data Exchange Markets via Utility Balancing
por: Bhaskara, Aditya, et al.
Publicado: (2024)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
por: Gupta, Sushmita, et al.
Publicado: (2024)

Randomized Binary and Tree Search under Pressure
por: Caracci, Agustín, et al.
Publicado: (2024)

A Little Aggression Goes a Long Way
por: Krishnan, Jyothi, et al.
Publicado: (2024)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
por: Glitzner, Frederik, et al.
Publicado: (2024)

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

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

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
por: Gupta, Sushmita, et al.
Publicado: (2024)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
por: Chen, Liyan, et al.
Publicado: (2024)