Beyond Moulin mechanisms (Q834858)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Beyond Moulin mechanisms	scientific article

Statements

scholarly article

0 references

Beyond Moulin mechanisms (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.geb.2008.06.005

0 references

0 references

Tim Roughgarden

0 references

Mukund Sundararajan

0 references

Games and Economic Behavior

0 references

publication date

27 August 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.geb.2008.06.005

0 references

0 references

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

0 references

Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location

0 references

Cost Sharing Methods for Makespan and Completion Time Scheduling

0 references

Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems

0 references

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

0 references

Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

0 references

A Greedy Heuristic for the Set-Covering Problem

0 references

0 references

Is Shapley Cost Sharing Optimal?

0 references

Optimum branchings

0 references

A threshold of ln <i>n</i> for approximating set cover

0 references

Hardness results for multicast cost sharing.

0 references

Cooperative facility location games

0 references

A General Approximation Technique for Constrained Forest Problems

0 references

Greedy Strikes Back: Improved Facility Location Algorithms

0 references

0 references

Cost-sharing mechanisms for network design

0 references

Heuristics for the fixed cost median problem

0 references

0 references

Applications of approximation algorithms to cooperative games

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

An approximation algorithm for the fault tolerant metric facility location problem

0 references

Equitable Cost Allocations via Primal–Dual-Type Algorithms

0 references

Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

0 references

Group strategyproof cost sharing: the role of indifferences

0 references

On the power of unique 2-prover 1-round games

0 references

0 references

Cross-monotonic cost sharing methods for connected facility location games

0 references

Approximation Algorithms for Metric Facility Location Problems

0 references

Incremental cost sharing: Characterization by coalition strategy-proofness

0 references

Strategyproof sharing of submodular costs: budget balance versus efficiency

0 references

0 references

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

0 references

New trade-offs in cost-sharing mechanisms

0 references

Optimal Efficiency Guarantees for Network Design Mechanisms

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:834858

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q834858&oldid=35124561"