278 search results - page 17 / 56 » Quantitative Fairness Games |
109
Voted
MVA
1994
15 years 1 months ago
1994
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
89
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
75
Voted
IISWC
2006
IEEE
15 years 6 months ago
2006
IEEE
—The rapid pace of change in 3D game technology makes workload characterization necessary for every game generation. Comparing to CPU characterization, far less quantitative info...
87
Voted
CG
2002
Springer
15 years 8 days ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
132
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relatio...