98 search results - page 6 / 20 » On the hardness of pricing loss-leaders |
IWPEC
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
There is significant experimental evidence that prediction markets are efficient mechanisms for aggregating information and are more accurate in forecasting events than tradition...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
AAAI
2006
13 years 10 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
ALGORITHMICA
2010
13 years 8 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...