Sharing the Cost of a Capacity Network

Authors:
Anna Bogomolnaia;Ron Holzman;Hervé Moulin
Affiliations:
Department of Economics, Rice University, Houston, Texas 77251;Department of Mathematics, Technion-Israel Institute of Technology, 32000 Haifa, Israel;Department of Economics, Rice University, Houston, Texas 77251
Venue:
Mathematics of Operations Research
Year:
2010

Citing 4
Cited 2

On the core of network synthesis games

Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graphs and Hypergraphs

Graphs and Hypergraphs

On the problem of revenue sharing in multi-domain federations

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Optimal Cost Sharing for Resource Selection Games

Mathematics of Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In a combinatorial auction m heterogenous indivisible items are sold to n bidders. This paper considers settings in which the valuation functions of the bidders are known to be complement free (a.k.a. subadditive). We provide several approximation ...