Dynamics of Profit-Sharing Games
From MaRDI portal
Publication:4985773
DOI10.1080/15427951.2013.830164zbMATH Open1465.91011arXiv1010.5081OpenAlexW2569059396MaRDI QIDQ4985773FDOQ4985773
Authors: Ning Chen, Edith Elkind, Angelo Fanelli, Dmitry Shiryaev, John Augustine, N. V. Gravin 
Publication date: 26 April 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Abstract: An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study the dynamics of coalition formation under bounded rationality. We consider settings where each team's profit is given by a convex function, and propose three profit-sharing schemes, each of which is based on the concept of marginal utility. The agents are assumed to be myopic, i.e., they keep changing teams as long as they can increase their payoff by doing so. We study the properties (such as closeness to Nash equilibrium or total profit) of the states that result after a polynomial number of such moves, and prove bounds on the price of anarchy and the price of stability of the corresponding games.
Full work available at URL: https://arxiv.org/abs/1010.5081
Recommendations
- Profit sharing and efficiency in utility games
- Equilibrium payoffs of dynamic games
- Profit sharing with thresholds and non-monotone player utilities
- Profit sharing with thresholds and non-monotone player utilities
- Dynamic Games in Economics
- Game dynamics and Nash equilibria
- Payoff-dependent dynamics and coordination games
- scientific article; zbMATH DE number 3904454
- Designing profit shares in matching and coalition formation games
Cites Work
- Title not available (Why is that?)
- A class of games possessing pure-strategy Nash equilibria
- Noncooperative selection of the core
- Potential games
- The Price of Stability for Network Design with Fair Cost Allocation
- How easy is local search?
- Combinatorial auctions with decreasing marginal utilities
- A noncooperative coalitional bargaining game with random proposers
- The speed of convergence in congestion games under best-response dynamics
- On the impact of combinatorial structure on congestion games
- Title not available (Why is that?)
- The complexity of pure Nash equilibria
- On best response dynamics in weighted congestion games with polynomial delays
- Restoring Pure Equilibria to Weighted Congestion Games
- Designing network protocols for good equilibria
- Simple Local Search Problems that are Hard to Solve
- On the Complexity of Cooperative Solution Concepts
- Optimal cost sharing for resource selection games
- Network design with weighted players
- Order independent equilibria
- Convergence to approximate Nash equilibria in congestion games
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Efficient coordination mechanisms for unrelated machine scheduling
- Preemptive coordination mechanisms for unrelated machines
- Title not available (Why is that?)
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- A Noncooperative Theory of Coalitional Bargaining
- Convergence and Approximation in Potential Games
- Computing Stable Outcomes in Hedonic Games
- Distributed welfare games
- Coalitions among computationally bounded agents
- Improving the price of anarchy for selfish routing via coordination mechanisms
- Settling the complexity of local max-cut (almost) completely
Cited In (12)
- An incentive compatible ZD strategy-based data sharing model for federated learning: a perspective of iterated prisoner's dilemma
- Title not available (Why is that?)
- Game-based coalescence in multi-agent systems
- Designing profit shares in matching and coalition formation games
- Project games
- Stable matching with network externalities
- Stochastic dynamic market share attraction games
- Profit sharing with thresholds and non-monotone player utilities
- Profit sharing with thresholds and non-monotone player utilities
- Profit sharing and efficiency in utility games
- Coalitional efficient profit-sharing
- Rationality of reward sharing in multi-agent reinforcement learning
This page was built for publication: Dynamics of Profit-Sharing Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985773)
