Computing Shapley values in the plane
DOI10.1007/S00454-021-00368-3OpenAlexW4213131548MaRDI QIDQ2118220FDOQ2118220
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/
Recommendations
arrangementsairport problemconvex hullconvolutionsShapley valuesbounding boxminimum enclosing diskstochastic computational geometry
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Data structures (68P05) Noncooperative games (91A10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- A Simple Expression for the Shapley Value in a Special Case
- Algorithmic Game Theory
- Minimum cost spanning tree games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- On approximately fair cost allocation in Euclidean TSP games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Computing the Centroid of the Vertices of an Arrangement and Related Problems
- On the complexity of testing membership in the core of min-cost spanning tree games
- Computational Aspects of Cooperative Game Theory
- Constructing Arrangements of Lines and Hyperplanes with Applications
- On the Complexity of Cooperative Solution Concepts
- New Data Structures for Orthogonal Range Queries
- Closest pair and the post office problem for stochastic points
- Stochastic minimum spanning trees in euclidean spaces
- On the Zone Theorem for Hyperplane Arrangements
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- New Upper Bounds in Klee’s Measure Problem
- Title not available (Why is that?)
- A cooperative location game based on the 1-center location problem
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Convex hulls under uncertainty
- Computing the Distance between Piecewise-Linear Bivariate Functions
- Algorithmic Cooperative Game Theory
- On the complexity of halfspace area queries
- A Course in Game Theory
- On the separability of stochastic geometric objects, with applications
- Hyperplane separability and convexity of probabilistic point sets
- Range-max queries on uncertain data
- Batched Point Location in SINR Diagrams via Algebraic Tools
- Title not available (Why is that?)
Cited In (2)
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)
