Sciweavers

10 search results - page 2 / 2
» Near-Optimal Pricing in Near-Linear Time
Sort
View
SPAA
2006
ACM
15 years 3 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
MANSCI
2006
104views more  MANSCI 2006»
14 years 9 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
JACM
2006
134views more  JACM 2006»
14 years 9 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
ICAI
2004
14 years 11 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger
GLOBECOM
2010
IEEE
14 years 7 months ago
Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...
Brigitte Jaumard, Jens Buysse, Ali Shaikh, Marc De...