scientific article; zbMATH DE number 7559220

DOI10.4230/LIPICS.SOCG.2019.20MaRDI QIDQ5088947zbMATH OpenFDO

Authors S. Cabello, Timothy M. Chan

Publication date 18 July 2022

Full work available at URL https://arxiv.org/abs/1804.03894

zbMATH Keywords

arrangementsairport problemconvex hullconvolutionsShapley valuesbounding boxminimum enclosing diskstochastic computational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing Shapley values in the plane
• The Shapley value on convex geometries
• Complexity of computing the Shapley value in partition function form games
• Computing Shapley Value in Supermodular Coalitional Games
• Algorithms for computing the Shapley value of cooperative games on lattices
• A linear approximation method for the Shapley value
• Polynomial calculation of the Shapley value based on sampling
• Publication:3496180
• The consistent Shapley value for hyperplane games
• Decomposition of solutions and the Shapley value

Cites work

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

Cited in

(2)

• Computing Shapley values in the plane
• The Shapley Value of Tuples in Query Answering.

This page was built for publication:

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