We propose a mechanism for auctioning bundles of multiple divisible goods in a network where buyers want the same amount of bandwidth on each link in their route. Buyers can specify multiple routes (corresponding to a source-destination pair). The total flow can then be split among these multiple ro
β¦ LIBER β¦
An algorithm for checking strong Nash implementability
β Scribed by Suh Sang-Chul
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 860 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0304-4068
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An efficient Nash-implementation mechani
β
Rahul Jain; Jean Walrand
π
Article
π
2010
π
Elsevier Science
π
English
β 422 KB
Implementation of an algorithm for elast
β
J.A. Bland
π
Article
π
1993
π
Elsevier Science
π
English
β 336 KB
An implementation of an efficient algori
β
Jean-Claude Fernandez
π
Article
π
1990
π
Elsevier Science
π
English
β 943 KB
An algorithm for approximate membership
β
Udi Manber; Sun Wu
π
Article
π
1994
π
Elsevier Science
π
English
β 706 KB
An order-based algorithm for implementin
β
JosΓ© A. PΓ©rez; Rafael Corchuelo; Miguel Toro
π
Article
π
2004
π
John Wiley and Sons
π
English
β 396 KB
## Abstract Multiparty interactions are a powerful mechanism for coordinating several entities that need to cooperate in order to achieve a common goal. In this paper, we present an algorithm for implementing them that improves on previous results in that it does not require the whole set of entiti
Implementing an affine scaling algorithm
β
Tom M. Cavalier; Kenneth C. Schall
π
Article
π
1987
π
Elsevier Science
π
English
β 612 KB