Computing Shapley values in the plane

DOI10.1007/S00454-021-00368-3MaRDI QIDQ2118220zbMATH OpenOpenAlexFDO

Authors S. Cabello, Timothy M. Chan

Publication date 22 March 2022

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2019/10424/

zbMATH Keywords

airport problemarrangementsbounding boxconvex hullconvolutionsminimum enclosing diskShapley valuesstochastic computational geometry

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Noncooperative games (91A10) Cooperative games (91A12)

Recommendations

• scientific article; zbMATH DE number 7559220
• Computing Shapley Value in Supermodular Coalitional Games
• scientific article; zbMATH DE number 219599
• Polynomial calculation of the Shapley value based on sampling
• Computing the Shapley value of threshold cardinality matching games

Cites work

• A cooperative location game based on the 1-center location problem
• A Course in Game Theory
• A course in game theory.
• A Simple Expression for the Shapley Value in a Special Case
• Algorithmic Cooperative Game Theory
• Algorithmic Game Theory
• Closest pair and the post office problem for stochastic points
• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
• Computational Aspects of Cooperative Game Theory
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Computational geometry. Algorithms and applications.
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
• scientific article; zbMATH DE number 44384 (Why is no real title available?)
• scientific article; zbMATH DE number 49749 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• scientific article; zbMATH DE number 7559220 (Why is no real title available?)
• Hyperplane separability and convexity of probabilistic point sets
• Minimum cost spanning tree games
• New Data Structures for Orthogonal Range Queries
• New Upper Bounds in Klee’s Measure Problem
• On approximately fair cost allocation in Euclidean TSP games
• On Computing the Centroid of the Vertices of an Arrangement and Related Problems
• On the Complexity of Cooperative Solution Concepts
• On the complexity of halfspace area queries
• On the complexity of testing membership in the core of min-cost spanning tree games
• On the separability of stochastic geometric objects, with applications
• On the Zone Theorem for Hyperplane Arrangements
• Range-max queries on uncertain data
• Stochastic minimum spanning trees in Euclidean spaces

Cited in

(3)

• scientific article; zbMATH DE number 7559220 (Why is no real title available?)
• The Shapley Value of Tuples in Query Answering.
• A subquadratic algorithm for computing the L₁-distance between two terrains

This page was built for publication: Computing Shapley values in the plane

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