Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games

DOI10.1007/s43069-023-00274-9MaRDI QIDQ6119818

Lucky Cho, Thomas C. Sharkey

Publication date: 20 February 2024

Published in: SN Operations Research Forum (Search for Journal in Brave)

zbMATH Keywords

game theoryinteger programmingschedulingprice of anarchyprice of stability

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Cost-sharing mechanisms for scheduling under general demand settings
• A coordination mechanism for a scheduling game with parallel-batching machines
• A computational approach to the multi-period many-to-one matching with ties
• Inefficiency of equilibria for scheduling game with machine activation costs
• Simple search methods for finding a Nash equilibrium
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
• Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
• The stable tournament problem: matching sports schedules with preferences
• Mathematical models for stable matching problems with ties and incomplete lists
• Computing equilibria for integer programming games
• Decentralized utilitarian mechanisms for scheduling games
• A class of games possessing pure-strategy Nash equilibria
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• Stable Matchings, Optimal Assignments, and Linear Programming
• Equilibrium Points of Bimatrix Games
• Many-to-One Stable Matching: Geometry and Fairness
• Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
• Scheduling games with machine-dependent priority lists
• College Admissions and the Stability of Marriage
• Dynamically stable matching

This page was built for publication: Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games