Recommendations
Cites work
- A course in game theory.
- Algorithmic mechanism design
- Communication Complexity
- Competitive auctions and digital goods
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Computationally feasible VCG mechanisms
- scientific article; zbMATH DE number 3650233 (Why is no real title available?)
- scientific article; zbMATH DE number 3670138 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Incentives in Teams
- Incentives, decentralized control, the assignment of joint costs and internal pricing
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility
Cited in
(57)- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Multirate multicast service provisioning. I: An algorithm for optimal price splitting along multicast trees
- Fair cost-sharing methods for scheduling jobs on parallel machines
- Hardness results for multicast cost sharing.
- Black-box reductions for cost-sharing mechanism design
- Approximation and collusion in multicast cost sharing
- A BGP-based mechanism for lowest-cost routing
- Designing fast converging cost sharing methods for multicast transmissions
- Trouble comes in threes: core stability in minimum cost connection networks
- Computer science and decision theory
- Mechanism design for policy routing
- Efficiency analysis of load balancing games with and without activation costs
- A survey on networking games in telecommunications
- Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks
- Diffusion auction design
- The Parallel Complexity of Coloring Games
- Pricing multicasting in more flexible network models
- Some notes on cost allocation in multicasting
- Sharing the cost of muliticast transmissions (preliminary version)
- Min-Cost Selfish Multicast With Network Coding
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
- Collusive dominant-strategy truthfulness
- An incentive-based distributed mechanism for scheduling divisible loads in tree networks
- scientific article; zbMATH DE number 1954379 (Why is no real title available?)
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Some results of Christos Papadimitriou on internet structure, network routing, and web information
- Better redistribution with inefficient allocation in multi-unit auctions
- Polyhedral study of the connected subgraph problem
- Fair Attribution of Functional Contribution in Artificial and Biological Networks
- scientific article; zbMATH DE number 2119763 (Why is no real title available?)
- A cross-layer optimization framework for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks
- Strategic sharing of a costly network
- Prize-collecting TSP with a budget constraint
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Structural Information and Communication Complexity
- Feature Selection via Coalitional Game Theory
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
- Algorithmic Applications in Management
- Computing and Combinatorics
- Black-box reductions for cost-sharing mechanism design
- Pricing multicast communication: A cost-based approach
- Cost sharing and strategyproof mechanisms for set cover games
- On Groves mechanisms for costly inclusion
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Distributed algorithmic mechanism design for scheduling on unrelated machines
- Price of stability in survivable network design
- Connected subgraphs, matching, and partitions
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions
- Bicriterial approximation for the incremental prize-collecting Steiner-tree problem
- Worst-case optimal redistribution of VCG payments in multi-unit auctions
- Stackelberg thresholds in network routing games or the value of altruism
- When ignorance helps: graphical multicast cost sharing games
- Sharing the cost of multicast transmissions in wireless networks
- Computationally-feasible truthful auctions for convex bundles
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
- Optimal-in-expectation redistribution mechanisms
This page was built for publication: Sharing the cost of multicast transmissions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952450)
