Strategyproof sharing of submodular costs: budget balance versus efficiency
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Almost budget-balanced VCG mechanisms to assign multiple objects
- Strong price of anarchy
- A cost-sharing method for an economic lot-sizing game
- Mechanism design for set cover games with selfish element agents
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- Cheating by groups and cheating over time in surplus sharing problems
- The Banzhaf power index on convex geometries
- Hardness results for multicast cost sharing.
- Coalition strategy-proof mechanisms for provision of excludable public goods.
- The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
- Sharing the cost of risky projects
- Is Shapley cost sharing optimal?
- Sharing loading costs for multi compartment vehicles
- The complexity of egalitarian mechanisms for linear programming games
- A subsidized Vickrey auction for cost sharing
- Designing cost-sharing methods for Bayesian games
- Black-box reductions for cost-sharing mechanism design
- Efficiency and budget balance in general quasi-linear domains
- Strategyproof cost sharing of a binary good and the egalitarian solution
- Welfare asymptotics of the pivotal mechanism for excludable public goods.
- Approximation and collusion in multicast cost sharing
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Strategyproofness, non-bossiness and group strategyproofness in a cost sharing model
- Pricing traffic in a spanning network
- Cost-sharing mechanism for excludable goods with generalized non-rivalry
- Population monotonicity in matching games
- A cost-sharing scheme for the \(k\)-level facility location game with penalties
- Reassignment-proof rules for land rental problems
- Optimal budget-balanced ranking mechanisms to assign identical objects
- Egalitarian equivalence and strategyproofness in the queueing problem
- On cost sharing in the provision of a binary and excludable public good
- Soft-capacitated facility location game
- Computer science and decision theory
- Gain-sharing in urban consolidation centers
- Adversarial behavior in network games
- Strategy-proof cost sharing under increasing returns: improvement of the supremal welfare loss
- Mechanism design with two alternatives in quasi-linear environments
- Collusion, efficiency, and dominant strategies
- The Moulin-Shenker rule
- Serial cost sharing of an excludable public good available in multiple units
- Incremental cost sharing: Characterization by coalition strategy-proofness
- A cross-monotonic cost-sharing scheme for the concave facility location game
- Ex-post optimal knapsack procurement
- Wary of the worst: maximizing award guarantees when new claimants may arrive
- Egalitarian division under Leontief preferences
- Group strategyproof cost sharing: the role of indifferences
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- The \(k\)-level facility location game
- Cost-sharing mechanisms for network design
- Competitive auctions
- The warehouse-retailer network design game
- Optimal VCG mechanisms to assign multiple bads
- Strategy-proof rules for an excludable public good
- Diffusion auction design
- Cost sharing in two-sided markets
- Collusion-proof mechanisms for multi-unit procurement
- A general impossibility theorem and its application to individual rights
- Designing cost-sharing methods for Bayesian games
- New trade-offs in cost-sharing mechanisms
- Optimal cost-sharing in general resource selection games
- Efficiency and Budget Balance
- Sharing rewards among strangers based on peer evaluations
- Optimal cost sharing for capacitated facility location games
- A rescheduling and cost allocation mechanism for delayed arrivals
- Network-formation games with regular objectives
- From cost sharing mechanisms to online selection problems
- Cost-sharing models in participatory sensing
- Implementing efficient graphs in connection networks
- Collusive dominant-strategy truthfulness
- Cost-sharing mechanisms for scheduling under general demand settings
- A cost-sharing method for an uncapacitated facility location game with penalties
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Cost sharing over combinatorial domains : Complement-free cost functions and beyond
- Cost sharing in production economies
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Group strategyproofness in queueing models
- The Price of Nash Equilibria in Multicast Transmissions Games
- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms
- Is Shapley Cost Sharing Optimal?
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
- Black-box reductions for cost-sharing mechanism design
- Sharing the cost of multicast transmissions
- Cost sharing and strategyproof mechanisms for set cover games
- On Groves mechanisms for costly inclusion
- Characterization of Vickrey auction with reserve price for multiple objects
- Budget-balanced and strategy-proof auctions for ridesharing
- scientific article; zbMATH DE number 7726315 (Why is no real title available?)
- Decentralized pricing in minimum cost spanning trees
- Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly
- Secure implementation in Shapley-Scarf housing markets
- A system-theoretic model for cooperation, interaction and allocation
- Cost allocation and strategyproof mechanism for cover-set games
- Game-theoretic analysis of the interaction of economic agents in the Cournot oligopoly with consideration of the linear structure, the green effect, and fairness concern
- A cost-sharing scheme for the k-product facility location game with penalties
- An approximate cost recovery scheme for the k-product facility location game with penalties
- Algorithmic solutions for maximizing shareable costs
- Fair tree connection games with topology-dependent edge cost
- Characterizing group strategy-proof rules in the object allocation problem with money
- Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms
This page was built for publication: Strategyproof sharing of submodular costs: budget balance versus efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955107)
