Beyond Moulin mechanisms (Q834858)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

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

Statements

scholarly article

Beyond Moulin mechanisms (English)

zbMATH Open document ID

10.1016/j.geb.2008.06.005

Tim Roughgarden

Mukund Sundararajan

Games and Economic Behavior

publication date

27 August 2009

Mathematics Subject Classification ID

zbMATH DE Number

MaRDI profile type

MaRDI publication profile

full work available at URL

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

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

Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location

Cost Sharing Methods for Makespan and Completion Time Scheduling

Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems

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

Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

A Greedy Heuristic for the Set-Covering Problem

Is Shapley Cost Sharing Optimal?

Optimum branchings

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

Hardness results for multicast cost sharing.

Cooperative facility location games

A General Approximation Technique for Constrained Forest Problems

Greedy Strikes Back: Improved Facility Location Algorithms

Cost-sharing mechanisms for network design

Heuristics for the fixed cost median problem

Applications of approximation algorithms to cooperative games

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

An approximation algorithm for the fault tolerant metric facility location problem

Equitable Cost Allocations via Primal–Dual-Type Algorithms

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

Group strategyproof cost sharing: the role of indifferences

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

Cross-monotonic cost sharing methods for connected facility location games

Approximation Algorithms for Metric Facility Location Problems

Incremental cost sharing: Characterization by coalition strategy-proofness

Strategyproof sharing of submodular costs: budget balance versus efficiency

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

New trade-offs in cost-sharing mechanisms

Optimal Efficiency Guarantees for Network Design Mechanisms

Sitelinks

Mathematics(1 entry)

mardi Publication:834858

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