Inapproximability of combinatorial public projects
Year of publication: |
2008
|
---|---|
Authors: | Schapira, Michael ; Singer, Yaron |
Published in: |
Internet and network economics : 4th international workshop, WINE 2008, Shanghai, China, December 17-20, 2008 ; proceedings. - Berlin : Springer, ISBN 3-540-92184-2. - 2008, p. 351-361
|
Subject: | Öffentliche Güter | Public goods | Auktionstheorie | Auction theory | Soziale Wohlfahrtsfunktion | Social welfare function | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Theorie | Theory |
-
Auction-based algorithm for solving scheduling problem in cross-docking centres
Paul, Eldho, (2020)
-
Scheduling and combinatorial auctions : Lagrangean relaxation-based bonds for the WJISP
Elendner, Thomas, (2003)
-
Strategy-proof multidimensional mechanism design
Basu, Ranojoy, (2024)
- More ...
-
Balkanski, Eric, (2022)
-
The Strategic Justification for BGP
Levin, Hagay, (2006)
-
Levin, Hagay, (2008)
- More ...