98 search results - page 8 / 20 » On the hardness of pricing loss-leaders |
142
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
HPDC
2007
IEEE
15 years 6 months ago
2007
IEEE
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
101
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
102
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
FOCI
2007
IEEE
15 years 6 months ago
2007
IEEE
— We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for ...