Imagen de Portada

An improved bound for the price of anarchy for related machine scheduling

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Berger, Andre, Rouhani, Arman, Schröder, Marc
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
por: Fujii, Kaito
Publicado: (2023)

Popularity in location games
por: Fournier, Gaëtan, et al.
Publicado: (2024)

The power of mediators: Price of anarchy and stability in Bayesian games with submodular social welfare
por: Fujii, Kaito
Publicado: (2025)

Interval Scheduling Games
por: Vijayalakshmi, Vipin Ravindran, et al.
Publicado: (2026)

No-Regret Online Autobidding Algorithms in First-price Auctions
por: Deng, Yuan, et al.
Publicado: (2025)

A flow-based ascending auction to compute buyer-optimal Walrasian prices
por: Eickhoff, Katharina, et al.
Publicado: (2023)

Bounds on the revenue gap of linear posted pricing for selling a divisible item
por: Caragiannis, Ioannis, et al.
Publicado: (2020)

Nash Flows Over Time with Tolls
por: Rosner, Shaul, et al.
Publicado: (2025)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
por: Mortazavi, Ali, et al.
Publicado: (2024)

Sharing delay costs in stochastic scheduling problems with delays
por: Gonçalves-Dosantos, J. C., et al.
Publicado: (2024)

Network Creation Games with 2-Neighborhood Maximization
por: de la Haye, Merlin, et al.
Publicado: (2025)

Stronger core results with multidimensional prices
por: Braverman, Mark, et al.
Publicado: (2026)

OpenAlpha: A Community-Led Adversarial Strategy Validation Mechanism for Decentralised Capital Management
por: Abgaryan, Arman, et al.
Publicado: (2025)

Learning-Augmented Metric Distortion via $(p,q)$-Veto Core
por: Berger, Ben, et al.
Publicado: (2023)

Algorithmic pricing with independent learners and relative experience replay
por: Han, Bingyan
Publicado: (2021)

A new lower bound for multi-color discrepancy with applications to fair division
por: Caragiannis, Ioannis, et al.
Publicado: (2025)

Economic Censorship Games in Fraud Proofs
por: Berger, Ben, et al.
Publicado: (2025)

Strategic Network Creation for Enabling Greedy Routing
por: Berger, Julian, et al.
Publicado: (2024)

Improved learning rates in multi-unit uniform price auctions
por: Potfer, Marius, et al.
Publicado: (2025)

An efficiency ordering of k-price auctions under complete information
por: Goel, Sumit, et al.
Publicado: (2025)

Learning in Games with Progressive Hiding
por: Heymann, Benjamin, et al.
Publicado: (2024)

Branch-and-price with novel cuts, and a new Stackelberg Security Game
por: Bustamante-Faúndez, Pamela, et al.
Publicado: (2024)

Selfish routing games with priority lanes
por: Li, Yang, et al.
Publicado: (2026)

An upper bound for the number of chess diagrams without promotion
por: Gourion, Daniel
Publicado: (2021)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
por: Han, Yanjun, et al.
Publicado: (2020)

Properties of Winning Iterated Prisoner's Dilemma Strategies
por: Glynatsi, Nikoleta E., et al.
Publicado: (2020)

Reviving, reproducing, and revisiting Axelrod's second tournament
por: Knight, Vincent, et al.
Publicado: (2025)

Optimal No-regret Learning in Repeated First-price Auctions
por: Han, Yanjun, et al.
Publicado: (2020)

The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
por: Wen, Yuxiao, et al.
Publicado: (2026)

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
por: Anagnostides, Ioannis, et al.
Publicado: (2026)

Lower bounds for ranking-based pivot rules
por: Disser, Yann, et al.
Publicado: (2025)

Collective schedules: axioms and algorithms
por: Durand, Martin, et al.
Publicado: (2024)

Computational bounds on randomized algorithms for online bin stretching
por: Lhomme, Antoine, et al.
Publicado: (2024)

Improved lower bounds for the maximum size of Condorcet domains
por: Karpov, Alexander, et al.
Publicado: (2026)

Side-by-side first-price auctions with imperfect bidders
por: Heymann, Benjamin
Publicado: (2025)

Study and improvement of search algorithms in two-players perfect information games
por: Cohen-Solal, Quentin
Publicado: (2025)

An explainable machine learning-based approach for analyzing customers' online data to identify the importance of product attributes
por: Karimzadeh, Aigin, et al.
Publicado: (2024)

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

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
por: Lazarsfeld, John, et al.
Publicado: (2025)

Optimal bounds for dissatisfaction in perpetual voting
por: Kozachinskiy, Alexander, et al.
Publicado: (2024)