Sciweavers

15 search results - page 1 / 3
» Tighter Bounds for Facility Games
Sort
View
WINE
2009
Springer
140views Economy» more  WINE 2009»
13 years 11 months ago
Tighter Bounds for Facility Games
In one dimensional facility games, public facilities are placed based on the reported locations of the agents, where all the locations of agents and facilities are on a real line. ...
Pinyan Lu, Yajun Wang, Yuan Zhou
COCOA
2009
Springer
13 years 11 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 4 months ago
On Pure and (approximate) Strong Equilibria of Facility Location Games
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
Thomas Dueholm Hansen, Orestis Telelis
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
CGF
2008
139views more  CGF 2008»
13 years 4 months ago
CHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
Oliver Mattausch, Jirí Bittner, Michael Wim...