DeepAI AI Chat
Log In Sign Up

Algorithmic Solutions for Maximizing Shareable Costs

02/28/2023
by   Rong Zou, et al.
Microsoft
University of Twente
NetEase, Inc
0

This paper addresses the optimization problem to maximize the total costs that can be shared among a group of agents, while maintaining stability in the sense of the core constraints of a cooperative transferable utility game, or TU game. This means that all subsets of agents have an outside option at a certain cost, and stability requires that the cost shares are defined so that none of the outside options is preferable. When maximizing total shareable costs, the cost shares must satisfy all constraints that define the core of a TU game, except for being budget balanced. The paper gives a fairly complete picture of the computational complexity of this optimization problem, in relation to classical computational problems on the core. We also show that, for games with an empty core, the problem is equivalent to computing minimal core relaxations for several relaxations that have been proposed earlier. As an example for a class of cost sharing games with non-empty core, we address minimum cost spanning tree games. While it is known that cost shares in the core can be found efficiently, we show that the computation of maximal cost shares is NP-hard for minimum cost spanning tree games. We also derive a 2-approximation algorithm. Our work opens several directions for future work.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/09/2021

On the minimum spanning tree problem in imprecise set-up

In this article, we study the Euclidean minimum spanning tree problem in...
07/24/2009

The Cost of Stability in Coalitional Games

A key question in cooperative game theory is that of coalitional stabili...
03/17/2020

On exact solutions for the minmax regret spanning tree problem

The Minmax Regret Spanning Tree problem is studied in this paper. This i...
11/01/2017

The Price of Information in Combinatorial Optimization

Consider a network design application where we wish to lay down a minimu...
02/03/2020

Quid Pro Quo allocations in Production-Inventory games

The concept of Owen point, introduced in Guardiola et al. (2009), is an ...
07/07/2003

Complexity of Determining Nonemptiness of the Core

Coalition formation is a key problem in automated negotiation among self...
08/21/2014

A Study of Proxies for Shapley Allocations of Transport Costs

We propose and evaluate a number of solutions to the problem of calculat...