Sciweavers

1034 search results - page 75 / 207
» Competitive generalized auctions
Sort
View
95
Voted
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
15 years 6 months ago
An Improved Algorithm for CIOQ Switches
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
Yossi Azar, Yossi Richter
85
Voted
ECAL
2003
Springer
15 years 5 months ago
Language Games with Mixed Populations
This paper presents an adaptation of Luc Steels’s model of Category Formation and Language Sharing. The simple competitive learning algorithm is proposed as a more general means ...
Michael Lewin, Emmet Spier
94
Voted
ORL
2008
87views more  ORL 2008»
14 years 11 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
117
Voted
WINE
2007
Springer
182views Economy» more  WINE 2007»
15 years 6 months ago
Mechanism Design on Trust Networks
We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed ...
Arpita Ghosh, Mohammad Mahdian, Daniel M. Reeves, ...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 6 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun