A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
From MaRDI portal
Publication:2664449
DOI10.1016/j.cor.2020.105094zbMath1458.91026OpenAlexW3084987877MaRDI QIDQ2664449
Mohammed Said Radjef, Sofiane Touati, Lakhdar Saïs
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105094
Monte Carlo methodapproximationShapley valuecooperative gameBayesian inferencebin packing gameweighted voting game
Monte Carlo methods (65C05) Cooperative games (91A12) Combinatorial optimization (90C27) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate core allocations and integrality gap for the bin packing game
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem
- Bin packing and related problems: general arc-flow formulation with graph compression
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Complexity of core allocation for the bin packing game
- On solving generalized Nash equilibrium problems via optimization
- Cost allocation: The traveling salesman, bin packing, and the knapsack
- The Shapley-Shubik index for simple games with multiple alternatives
- Polynomial calculation of the Shapley value based on sampling
- The traveling salesman game: An application of cost allocation in a gas and oil company
- Social enterprise tree network games
- Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation
- An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
- Efficient algorithms for real-life instances of the variable size bin packing problem
- Algorithms for computing the Shapley value of cooperative games on lattices
- Theory of statistics
- A linear approximation method for the Shapley value
- Computing generalized Nash equilibria by polynomial programming
- Efficient algorithms for the offline variable sized bin-packing problem
- A polynomial rule for the problem of sharing delay costs in PERT networks
- A review on cost allocation methods in collaborative transportation
- The Convergence Time for Selfish Bin Packing
- On some approximately balanced combinatorial cooperative games
- Approximate Core Allocation for Binpacking Games
- On the Complexity of Cooperative Solution Concepts
- Cost Allocation for Horizontal Carrier Coalitions Based on Approximated Shapley Values
- Introduction to the Theory of Cooperative Games
- Generalized Nash equilibrium problems
- Generating functions for computing power indices efficiently
