Fetching the paper…
Reading the bibliography…
We consider the problem of computing Shapley values for points in the plane, where each point is interpreted as a player, and the value of a coalition is defined by the area of usual geometric objects, such as the convex hull or the minimum axis-parallel bounding box.
A simple expression for the Shapely value in a special case
S. Littlechild and G. Owen · 1973
Earlier work this paper cites.
Computational complexity of the game theory approach to cost allocation for a tree
N. Megiddo · 1978
Earlier work this paper cites.
New data structures for orthogonal range queries
D. E. Willard · 1985
Earlier work this paper cites.
Constructing arrangements of lines and hyperplanes with applications
H. Edelsbrunner, J. O’Rourke, and R. Seidel · 1986
Earlier work this paper cites.
The Shapley Value: Essays in Honor of Lloyd S. Shapley
A. E. Roth, editor · 1988
Earlier work this paper cites.
Smallest enclosing disks (balls and ellipsoids)
E. Welzl · 1991
Earlier work this paper cites.
On the zone theorem for hyperplane arrangements
H. Edelsbrunner, R. Seidel, and M. Sharir · 1993
Earlier work this paper cites.
On the complexity of cooperative solution concepts
X. Deng and C. H. Papadimitriou · 1994
Earlier work this paper cites.
A course in game theory
M. J. Osborne and A. Rubinstein · 1994
Earlier work this paper cites.
Game theory - Analysis of Conflict
R. B. Myerson · 1997
Earlier work this paper cites.
On approximately fair cost allocation in Euclidean TSP games
U. Faigle, S. P. Fekete, W. Hochstättler, and W. Kern · 1998
Cited alongside, same era.
Lectures on Discrete Geometry
J. Matoušek · 2002
Cited alongside, same era.
The Shapley value
E. Winter · 2002
Cited alongside, same era.
On computing the centroid of the vertices of an arrangement and related problems
D. Ajwani, S. Ray, R. Seidel, and H. R. Tiwary · 2007
Cited alongside, same era.
Algorithmic Game Theory
N. Nisan, T. Roughgarden, É. Tardos, and V. V. Vazirani · 2007
Cited alongside, same era.
Computational geometry: algorithms and applications, 3rd Edition
M. de Berg, O. Cheong, M. J. van Kreveld, and M. H. Overmars · 2008
Cited alongside, same era.
Closest pair and the post office problem for stochastic points
P. Kamousi, T. M. Chan, and S. Suri · 2012
Later among the works it cites.
Game theory, 2nd edition, 2014
T. S. Ferguson · 2014
Later among the works it cites.
Cost allocation and airport problems, 2013
W. Thomson · 2014
Later among the works it cites.
Computing the distance between piecewise-linear bivariate functions
G. Moroz and B. Aronov · 2016
Later among the works it cites.
Area and perimeter of the convex hull of stochastic points
P. Pérez-Lantero · 2016
Later among the works it cites.
Convex hulls under uncertainty
P. K. Agarwal, S. Har-Peled, S. Suri, H. Yildiz, and W. Zhang · 2017
Later among the works it cites.
Range-max queries on uncertain data
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
X. Deng and Q. Fang · 2008
Cited alongside, same era.
Stochastic minimum spanning trees in Euclidean spaces
P. Kamousi, T. M. Chan, and S. Suri · 2011
Cited alongside, same era.
A cooperative location game based on the 1-center location problem
J. Puerto, A. Tamir, and F. Perea · 2011
Cited alongside, same era.
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
J. Puerto, A. Tamir, and F. Perea · 2011
Cited alongside, same era.
P. K. Agarwal, N. Kumar, S. Sintos, and S. Suri · 2017
Later among the works it cites.
Hyperplane separability and convexity of probabilistic point sets
M. Fink, J. Hershberger, N. Kumar, and S. Suri · 2017
Later among the works it cites.
Batched point location in SINR diagrams via algebraic tools
B. Aronov and M. J. Katz · 2018
Closest in time.
On the separability of stochastic geometric objects, with applications
J. Xue, Y. Li, and R. Janardan · 2018
Closest in time.