A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games

DOI10.1016/J.COR.2020.105094MaRDI QIDQ2664449zbMATH OpenOpenAlexFDO

Authors Sofiane Touati, Mohammed Said Radjef, Lakhdar Sais

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

zbMATH Keywords

approximationBayesian inferencebin packing gamecooperative gameMonte Carlo methodShapley valueweighted voting game

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Combinatorial optimization (90C27) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Cooperative games (91A12)

Recommendations

• Monte Carlo methods for the Shapley-Shubik power index
• scientific article; zbMATH DE number 7274136
• scientific article; zbMATH DE number 1164583
• scientific article; zbMATH DE number 1149742
• Potential approach and characterizations of a Shapley value in multi-choice games
• Designing cost-sharing methods for Bayesian games
• Designing cost-sharing methods for Bayesian games
• A dynamic approach to the Shapley value based on associated games
• Computing Shapley Value in Supermodular Coalitional Games
• A new weight scheme for the Shapley value

Cites work

• A grouping genetic algorithm with controlled gene transmission for the bin packing problem
• A linear approximation method for the Shapley value
• A polynomial rule for the problem of sharing delay costs in PERT networks
• A review on cost allocation methods in collaborative transportation
• Algorithms for computing the Shapley value of cooperative games on lattices
• An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution
• Approximate Core Allocation for Binpacking Games
• Approximate core allocations and integrality gap for the bin packing game
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Bin packing and related problems: general arc-flow formulation with graph compression
• Complexity of core allocation for the bin packing game
• Computing generalized Nash equilibria by polynomial programming
• Cost allocation for horizontal carrier coalitions based on approximated Shapley values
• Cost allocation: The traveling salesman, bin packing, and the knapsack
• Efficient algorithms for real-life instances of the variable size bin packing problem
• Efficient algorithms for the offline variable sized bin-packing problem
• Game theory
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• Generalized Nash equilibrium problems
• Generating functions for computing power indices efficiently
• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1218462 (Why is no real title available?)
• scientific article; zbMATH DE number 5026801 (Why is no real title available?)
• Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation
• Introduction to the Theory of Cooperative Games
• On solving generalized Nash equilibrium problems via optimization
• On some approximately balanced combinatorial cooperative games
• On the Complexity of Cooperative Solution Concepts
• Polynomial calculation of the Shapley value based on sampling
• Social enterprise tree network games
• The Convergence Time for Selfish Bin Packing
• The Shapley-Shubik index for simple games with multiple alternatives
• The traveling salesman game: An application of cost allocation in a gas and oil company
• Theory of statistics

Cited in

(6)

• Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation
• A stochastic approach to approximate values in cooperative games
• Monte Carlo methods for the Shapley-Shubik power index
• scientific article; zbMATH DE number 7274136 (Why is no real title available?)
• Fast Shapley value approximation through machine learning with application in routing problems
• Polynomial calculation of the Shapley value based on sampling

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664449)