Sciweavers

1524 search results - page 74 / 305
» Game Relations and Metrics
Sort
View
76
Voted
TARK
2005
Springer
15 years 6 months ago
Order independence and rationalizability
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of...
Krzysztof R. Apt
116
Voted
JSYML
2011
108views more  JSYML 2011»
14 years 7 months ago
Analytic equivalence relations and bi-embeddability
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
Sy-David Friedman, Luca Motto Ros
108
Voted
ASYNC
2005
IEEE
118views Hardware» more  ASYNC 2005»
15 years 6 months ago
Modeling and Verifying Circuits Using Generalized Relative Timing
We propose a novel technique for modeling and verifying timed circuits based on the notion of generalized relative timing. Generalized relative timing constraints can express not ...
Sanjit A. Seshia, Randal E. Bryant, Kenneth S. Ste...
117
Voted
FASE
2006
Springer
15 years 4 months ago
Relation of Code Clones and Change Couplings
Abstract. Code clones have long been recognized as bad smells in software systems and are considered to cause maintenance problems during evolution. It is broadly assumed that the ...
Reto Geiger, Beat Fluri, Harald Gall, Martin Pinzg...
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
15 years 7 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella