Profit sharing and efficiency in utility games
From MaRDI portal
Publication:5111732
DOI10.4230/LIPICS.ESA.2017.43zbMATH Open1448.91059MaRDI QIDQ5111732FDOQ5111732
Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika, Sreenivas Gollapudi
Publication date: 27 May 2020
Recommendations
Cites Work
- Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
- A class of games possessing pure-strategy Nash equilibria
- Optimal Cost-Sharing in Weighted Congestion Games
- Potential games
- On weighted Shapley values
- Intrinsic robustness of the price of anarchy
- The worst-case efficiency of cost sharing methods in resource allocation games
- Restoring Pure Equilibria to Weighted Congestion Games
- Designing Network Protocols for Good Equilibria
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- Inapproximability results for combinatorial auctions with submodular utility functions
- Distributed Welfare Games
- Incentives and Efficiency in Uncertain Collaborative Environments
- The power of local search: maximum coverage over a matroid
- Online submodular welfare maximization: Greedy is optimal
Cited In (8)
- An incentive compatible ZD strategy-based data sharing model for federated learning: a perspective of iterated prisoner's dilemma
- Profit-sharing and efficient time allocation
- Inefficiency and complementarity in sharing games
- The profit-sharing rule that maximizes sustainability of cartel agreements
- Project games
- Dynamics of Profit-Sharing Games
- Optimal design of profit sharing rates by FFT
- Arbitrary profit sharing in federated learning utility games
This page was built for publication: Profit sharing and efficiency in utility games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111732)
