𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tractable combinatorial auctions and b-matching

✍ Scribed by Moshe Tennenholtz

Book ID
108306922
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
117 KB
Volume
140
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Implementing a strategyproof greedy-allo
Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction
✍ Takayuki Ito; Makoto Yokoo; Shigeo Matsubara; Atsushi Iwasaki πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 482 KB

## Abstract This paper proposes a new combinatorial auction protocol called Average‐Max‐Minimal‐Bundle (AM‐MB) protocol. The characteristics of the AM‐MB protocol are as follows: (i) it is strategyproof, that is, truth‐telling is a dominant strategy, (ii) the computational overhead is very low, sin

[Algorithms and Combinatorics] Combinato
[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || b-Matchings and T-Joins
✍ , πŸ“‚ Article πŸ“… 2008 πŸ› Springer Berlin Heidelberg 🌐 German βš– 334 KB

Graphs -- Linear Programming -- Linear Programming Algorithms -- Integer Programming -- Spanning Trees And Arborescences -- Shortest Paths -- Network Flows -- Minimum Cost Flows -- Maximum Matchings -- Weighted Matching -- B-matchings And T-joins -- Matroids -- Generalizations Of Matroids -- Np-comp