Sciweavers

1449 search results - page 277 / 290
» Finiteness results for sigmoidal
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 12 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
ADCM
2010
90views more  ADCM 2010»
14 years 12 months ago
Local reconstruction for sampling in shift-invariant spaces
The local reconstruction from samples is one of most desirable properties for many applications in signal processing, but it has not been given as much attention. In this paper, we...
Qiyu Sun
ALGORITHMICA
2010
152views more  ALGORITHMICA 2010»
14 years 12 months ago
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
We study the equilibrium behavior of informed traders interacting with market scoring rule (MSR) market makers. One attractive feature of MSR is that it is myopically incentive com...
Yiling Chen, Stanko Dimitrov, Rahul Sami, Daniel M...
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
14 years 12 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
82
Voted
AMAI
2008
Springer
14 years 12 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka