Sciweavers

1410 search results - page 42 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
CVPR
2009
IEEE
16 years 5 months ago
A Collaborative Benchmark for Region of Interest Detection Algorithms
This paper presents a collaborative benchmark for region of interest (ROI) detection in images. ROI detection has many useful applications and many algorithms have been proposed...
Tz-Huan Huang, Kai-Yin Cheng and Yung-Yu Chuang
AAIM
2009
Springer
105views Algorithms» more  AAIM 2009»
15 years 5 months ago
On Acyclicity of Games with Cycles
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...
FOCS
2007
IEEE
15 years 5 months ago
Computing Equilibria in Anonymous Games
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
Constantinos Daskalakis, Christos H. Papadimitriou
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
15 years 4 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
15 years 5 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail