Sciweavers

16091 search results - page 2919 / 3219
» Solving
Sort
View
SENSYS
2004
ACM
16 years 6 days ago
Mitigating congestion in wireless sensor networks
Network congestion occurs when offered traffic load exceeds available capacity at any point in a network. In wireless sensor networks, congestion causes overall channel quality t...
Bret Hull, Kyle Jamieson, Hari Balakrishnan
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
16 years 6 days ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
16 years 6 days ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2004
ACM
132views ECommerce» more  SIGECOM 2004»
16 years 6 days ago
A dynamic pari-mutuel market for hedging, wagering, and information aggregation
I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a contin...
David M. Pennock
SPAA
2004
ACM
16 years 6 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
« Prev « First page 2919 / 3219 Last » Next »