1285 search results - page 6 / 257 » On the Complexity of Ordinal Clustering |
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
JAIR
2008
13 years 7 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
ICMI
2005
Springer
14 years 1 months ago
2005
Springer
Visual information overload is a threat to the interpretation of displays presenting large data sets or complex application environments. To combat this problem, researchers have ...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...