Lipschitz continuous allocations for optimization games
From MaRDI portal
Cites work
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Approximate Core Allocation for Binpacking Games
- Approximate core allocations and integrality gap for the bin packing game
- Approximate core allocations for edge cover games
- Average sensitivity of dynamic programming
- Average Sensitivity of Graph Algorithms
- Bin packing games
- Complexity of constructing solutions in the core based on synergies among coalitions
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- Cost allocation for a spanning tree
- Integrality gap analysis for bin packing games
- Lipschitz continuous algorithms for graph problems
- Minimum cost spanning tree games
- On approximately fair cost allocation in Euclidean TSP games
- On cost allocation for a spanning tree: A game theoretic approach
- On some approximately balanced combinatorial cooperative games
- On the complexity of testing membership in the core of min-cost spanning tree games
- On the rate of taxation in a cooperative bin packing game
- Quasi-Cores in a Monetary Economy with Nonconvex Preferences
- Stable outcomes of the roommate game with transferable utility
- The assignment game. I: The core
- The complexity of matching games: a survey
- The general graph matching game: approximate core
- The stable fixtures problem with payments
This page was built for publication: Lipschitz continuous allocations for optimization games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875089)
