Sciweavers

1653 search results - page 301 / 331
» Computer science and game theory
Sort
View
IPSN
2004
Springer
14 years 2 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
ATAL
2008
Springer
13 years 10 months ago
Distributed multiagent resource allocation in diminishing marginal return domains
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
Yoram Bachrach, Jeffrey S. Rosenschein
ICFP
2010
ACM
13 years 9 months ago
TeachScheme!: a checkpoint
In 1995, my team and I decided to create an outreach project that would use our research on functional programming to change the K-12 computer science curriculum. We had two diffe...
Matthias Felleisen
GC
2008
Springer
13 years 8 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
SIGECOM
2011
ACM
320views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Market making and mean reversion
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
Tanmoy Chakraborty, Michael Kearns