Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner |
| |
Institution: | 1. United States Navy, USA;2. Mathematics Department, United States Naval Academy, Annapolis, MD, USA |
| |
Abstract: | We investigate privacy-preserving ways of allocating payoffs among players participating in a joint venture, using tools from cooperative game theory and differential privacy. In particular, we examine linear programming games, an important class of cooperative games that model a myriad of payoff sharing problems, including those from logistics and network design. We show that we can compute a payoff allocation in the approximate core of these games in a way that satisfies joint differential privacy. |
| |
Keywords: | Cooperative games Differential privacy Payoff sharing Cost sharing |
本文献已被 ScienceDirect 等数据库收录! |
|