Pages that link to "Item:Q1401398"

The following pages link to Hardness results for multicast cost sharing. (Q1401398):

Displaying 18 items.

• Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions (Q543608) (← links)
• Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
• Beyond Moulin mechanisms (Q834858) (← links)
• The communication cost of selfishness (Q840676) (← 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)
• New efficiency results for makespan cost sharing (Q963402) (← 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)
• Approximation and collusion in multicast cost sharing (Q1885423) (← links)
• A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
• Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
• On the convergence of multicast games in directed networks (Q2379922) (← links)
• The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
• Cost sharing over combinatorial domains : Complement-free cost functions and beyond (Q5075756) (← links)
• The Price of Nash Equilibria in Multicast Transmissions Games (Q5387773) (← links)
• Is Shapley Cost Sharing Optimal? (Q5459997) (← links)