Opponent Indifference in Rating Systems: A Theoretical Case for Sonas
Fuente:
arXiv
Guardado en:
| Autores principales: | Bodwin, Greg, Zhang, Forest |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Static Pricing Guarantees for Queueing Systems
por: Bergquist, Jacob, et al.
Publicado: (2023)
por: Bergquist, Jacob, et al.
Publicado: (2023)
Revisiting Fair and Efficient Allocations for Bivalued Goods
por: Liu, Hui, et al.
Publicado: (2026)
por: Liu, Hui, et al.
Publicado: (2026)
Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
por: Ganesh, Aadityan, et al.
Publicado: (2025)
por: Ganesh, Aadityan, et al.
Publicado: (2025)
The Geometry of Coalition Power: Majorization, Lattices, and Displacement in Multiwinner Elections
por: Guo, Qian, et al.
Publicado: (2026)
por: Guo, Qian, et al.
Publicado: (2026)
How to Balance the Load Online When Jobs and Machines Are Both Selfish?
por: Wang, Wenqian, et al.
Publicado: (2024)
por: Wang, Wenqian, et al.
Publicado: (2024)
Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
por: Feng, Yuda, et al.
Publicado: (2024)
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)
por: Bei, Xiaohui, et al.
Publicado: (2025)
Maximizing social welfare among EF1 allocations at the presence of two types of agents
por: Ma, Jiaxuan, et al.
Publicado: (2025)
por: Ma, Jiaxuan, et al.
Publicado: (2025)
A Minimax Perspective on Almost-Stable Matchings
por: Glitzner, Frederik, et al.
Publicado: (2026)
por: Glitzner, Frederik, et al.
Publicado: (2026)
A Strongly Polynomial Algorithm for Arctic Auctions
por: Garg, Jugal, et al.
Publicado: (2026)
por: Garg, Jugal, et al.
Publicado: (2026)
A Little Aggression Goes a Long Way
por: Krishnan, Jyothi, et al.
Publicado: (2024)
por: Krishnan, Jyothi, et al.
Publicado: (2024)
A symmetric recursive algorithm for mean-payoff games
por: Ohlmann, Pierre
Publicado: (2026)
por: Ohlmann, Pierre
Publicado: (2026)
MATWA: A Web Toolkit for Matching under Preferences
por: Glitzner, Frederik, et al.
Publicado: (2024)
por: Glitzner, Frederik, et al.
Publicado: (2024)
A Reduction from Chores Allocation to Job Scheduling
por: Huang, Xin, et al.
Publicado: (2023)
por: Huang, Xin, et al.
Publicado: (2023)
Repeated Descent: A Framework for Online Budget-Feasible Auctions
por: Charalampopoulos, Andreas, et al.
Publicado: (2026)
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)
por: Feng, Yuda, et al.
Publicado: (2024)
A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
por: Charalampopoulos, Andreas, et al.
Publicado: (2025)
por: Charalampopoulos, Andreas, et al.
Publicado: (2025)
EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture
por: Afshinmehr, Mahyar, et al.
Publicado: (2024)
por: Afshinmehr, Mahyar, et al.
Publicado: (2024)
Minimization I.I.D. Prophet Inequality via Extreme Value Theory: A Unified Approach
por: Livanos, Vasilis, et al.
Publicado: (2024)
por: Livanos, Vasilis, et al.
Publicado: (2024)
A Theoretical Model for Grit in Pursuing Ambitious Ends
por: Blum, Avrim, et al.
Publicado: (2025)
por: Blum, Avrim, et al.
Publicado: (2025)
Edge-weighted Online Stochastic Matching: Beating $1-\frac1e$
por: Yan, Shuyi
Publicado: (2022)
por: Yan, Shuyi
Publicado: (2022)
Online Resource Allocation with Cancellations
por: Ekbatani, Farbod, et al.
Publicado: (2022)
por: Ekbatani, Farbod, et al.
Publicado: (2022)
Truthful Matching with Online Items and Offline Agents
por: Feldman, Michal, et al.
Publicado: (2022)
por: Feldman, Michal, et al.
Publicado: (2022)
Approximating Nash Social Welfare by Matching and Local Search
por: Garg, Jugal, et al.
Publicado: (2022)
por: Garg, Jugal, et al.
Publicado: (2022)
Online Nash Welfare Maximization Without Predictions
por: Huang, Zhiyi, et al.
Publicado: (2022)
por: Huang, Zhiyi, et al.
Publicado: (2022)
Envy-freeness in 3D Hedonic Games
por: McKay, Michael, et al.
Publicado: (2022)
por: McKay, Michael, et al.
Publicado: (2022)
Condorcet Dimension and Pareto Optimality for Matchings and Beyond
por: Kavitha, Telikepalli, et al.
Publicado: (2026)
por: Kavitha, Telikepalli, et al.
Publicado: (2026)
Best of Both Worlds Guarantees for Equitable Allocations
por: Bhaskar, Umang, et al.
Publicado: (2025)
por: Bhaskar, Umang, et al.
Publicado: (2025)
Universal Online Contention Resolution with Preselected Order
por: Zhao, Junyao
Publicado: (2025)
por: Zhao, Junyao
Publicado: (2025)
The Min Max Average Cycle Weight Problem
por: Elmalem, Noga Klein, et al.
Publicado: (2025)
por: Elmalem, Noga Klein, et al.
Publicado: (2025)
Matching with Nested and Bundled Pandora Boxes
por: Bowers, Robin, et al.
Publicado: (2024)
por: Bowers, Robin, et al.
Publicado: (2024)
Online Job Assignment
por: Ekbatani, Farbod, et al.
Publicado: (2025)
por: Ekbatani, Farbod, et al.
Publicado: (2025)
Near-Feasible Stable Matchings: Incentives and Optimality
por: Glitzner, Frederik
Publicado: (2026)
por: Glitzner, Frederik
Publicado: (2026)
Additively Competitive Secretaries
por: Mahdian, Mohammad, et al.
Publicado: (2026)
por: Mahdian, Mohammad, et al.
Publicado: (2026)
Data Exchange Markets via Utility Balancing
por: Bhaskara, Aditya, et al.
Publicado: (2024)
por: Bhaskara, Aditya, et al.
Publicado: (2024)
Pandora's Problem with Combinatorial Cost
por: Berger, Ben, et al.
Publicado: (2023)
por: Berger, Ben, et al.
Publicado: (2023)
Budget-feasible Egalitarian Allocation of Conflicting Jobs
por: Gupta, Sushmita, et al.
Publicado: (2024)
por: Gupta, Sushmita, et al.
Publicado: (2024)
Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
por: Constantinescu, Andrei, et al.
Publicado: (2023)
por: Constantinescu, Andrei, et al.
Publicado: (2023)
Randomized Binary and Tree Search under Pressure
por: Caracci, Agustín, et al.
Publicado: (2024)
por: Caracci, Agustín, et al.
Publicado: (2024)
Threshold Testing and Semi-Online Prophet Inequalities
por: Hoefer, Martin, et al.
Publicado: (2023)
por: Hoefer, Martin, et al.
Publicado: (2023)
Ejemplares similares
-
Static Pricing Guarantees for Queueing Systems
por: Bergquist, Jacob, et al.
Publicado: (2023) -
Revisiting Fair and Efficient Allocations for Bivalued Goods
por: Liu, Hui, et al.
Publicado: (2026) -
Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
por: Ganesh, Aadityan, et al.
Publicado: (2025) -
The Geometry of Coalition Power: Majorization, Lattices, and Displacement in Multiwinner Elections
por: Guo, Qian, et al.
Publicado: (2026) -
How to Balance the Load Online When Jobs and Machines Are Both Selfish?
por: Wang, Wenqian, et al.
Publicado: (2024)