Sciweavers

4066 search results - page 77 / 814
» Almost Complete Sets
Sort
View
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
UML
2004
Springer
15 years 11 months ago
The TopModL Initiative
We believe that there is a very strong need for an environment to support research and experiments on model-driven engineering. Therefore we have started the TopModL project, an o...
Pierre-Alain Muller, Cédric Dumoulin, Fr&ea...
INFOCOM
2010
IEEE
15 years 4 months ago
Socially-Aware Network Design Games
—In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wh...
Jocelyne Elias, Fabio Martignon, Konstantin Avrach...
CN
2011
127views more  CN 2011»
15 years 1 months ago
A game theoretic analysis of network design with socially-aware users
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
Jocelyne Elias, Fabio Martignon, Konstantin Avrach...
CL
2000
Springer
15 years 10 months ago
Dominance Constraints with Set Operators
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
Denys Duchier, Joachim Niehren