Sciweavers

272 search results - page 30 / 55
» Simple versus optimal mechanisms
Sort
View
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
14 years 2 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 8 months ago
Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
Gesualdo Scutari, Sergio Barbarossa
MANSCI
2006
104views more  MANSCI 2006»
13 years 7 months ago
Procuring Fast Delivery: Sole Sourcing with Information Asymmetry
This paper studies a queuing model in which a buyer sources a good or service from an single supplier chosen from a pool of suppliers. The buyer seeks to minimize the sum of her p...
Gérard P. Cachon, Fuqiang Zhang
CORR
2008
Springer
134views Education» more  CORR 2008»
13 years 8 months ago
Online Ad Slotting With Cancellations
Many advertisers (bidders) use Internet systems to buy advertisements on publishers' webpages or on traditional media such as radio, TV and newsprint. They seek a simple, onl...
Florin Constantin, Jon Feldman, S. Muthukrishnan, ...

Publication
767views
15 years 6 months ago
Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...
D. Chiu and R. Jain