Pages that link to "Item:Q1885423"

The following pages link to Approximation and collusion in multicast cost sharing (Q1885423):

Displaying 16 items.

• Optimal cost sharing for capacitated facility location games (Q297094) (← links)
• Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
• Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
• When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
• Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
• Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
• Mechanism design for set cover games with selfish element agents (Q1041237) (← links)
• Hardness results for multicast cost sharing. (Q1401398) (← links)
• Network QoS games: stability vs optimality tradeoff (Q1880785) (← links)
• A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
• Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
• Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
• On the convergence of multicast games in directed networks (Q2379922) (← links)
• Cost Sharing in Production Economies (Q5150292) (← links)
• The Price of Nash Equilibria in Multicast Transmissions Games (Q5387773) (← links)