Cost-sharing games with rank-based utilities

DOI10.1007/978-3-031-15714-1_16zbMath1520.91209OpenAlexW4297821566MaRDI QIDQ6109525

Tami Tamir, Shaul Rosner

Publication date: 28 July 2023

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15714-1_16

zbMATH Keywords

competitioncost-sharing gamesequilibrium existence and inefficiencyrank-based utilities

Mathematics Subject Classification ID

Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Algorithmic game theory and complexity (91A68)

Related Items (1)

Scheduling games with rank-based utilities

Cites Work

• Unnamed Item
• Cost-sharing scheduling games on restricted unrelated machines
• Worst-case equilibria
• Network design with weighted players
• Ranking games
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Grading exams: 100,99,98,\(\dots \) or \(A,B,C\)?
• Games of status and discriminatory contracts
• Potential games
• Congestion games with player-specific payoff functions
• Ranking games that have competitiveness-based strategies
• Race scheduling games
• Strong equilibria in games with the lexicographical improvement property
• A class of games possessing pure-strategy Nash equilibria
• The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
• Optimal Cost-Sharing in General Resource Selection Games
• The Price of Stability for Network Design with Fair Cost Allocation
• A Theory of Fairness, Competition, and Cooperation
• Algorithms, games, and the internet
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games

This page was built for publication: Cost-sharing games with rank-based utilities