Pages that link to "Item:Q2386316"

The following pages link to Incremental cost sharing: Characterization by coalition strategy-proofness (Q2386316):

Displaying 44 items.

• A general impossibility theorem and its application to individual rights (Q277315) (← links)
• Implementing efficient graphs in connection networks (Q382330) (← links)
• Collusive dominant-strategy truthfulness (Q417640) (← links)
• Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
• A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← links)
• Beyond Moulin mechanisms (Q834858) (← links)
• On the equivalence of coalitional and individual strategy-proofness properties (Q839623) (← links)
• Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
• New efficiency results for makespan cost sharing (Q963402) (← links)
• Foundations of mechanism design: a tutorial. II. Advanced concepts and results (Q1001138) (← links)
• Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
• On coalition-proof Nash equilibria in common agency games (Q1289254) (← links)
• Hardness results for multicast cost sharing. (Q1401398) (← links)
• Coherent cost-sharing rules (Q1593750) (← links)
• Coalition-proof full efficient implementation (Q1622381) (← links)
• The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
• Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
• Three methods to share joint costs or surplus (Q1806203) (← links)
• Strategic properties of heterogeneous serial cost sharing (Q1867839) (← links)
• Approximation and collusion in multicast cost sharing (Q1885423) (← links)
• Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results (Q1938825) (← links)
• Individual versus group strategy-proofness: when do they coincide? (Q1958948) (← links)
• Coalitional efficient profit-sharing (Q2036964) (← links)
• Population monotonicity in matching games (Q2136163) (← links)
• Computer science and decision theory (Q2271874) (← links)
• Strategy-proof cost sharing under increasing returns: improvement of the supremal welfare loss (Q2345238) (← links)
• Mechanism design with two alternatives in quasi-linear environments (Q2353701) (← links)
• Collusion, efficiency, and dominant strategies (Q2357811) (← links)
• Serial cost sharing of an excludable public good available in multiple units (Q2385129) (← links)
• Ex-post optimal knapsack procurement (Q2402058) (← links)
• Group strategyproof cost sharing: the role of indifferences (Q2437817) (← links)
• Improved approximation algorithms for low-density instances of the minimum entropy set cover problem (Q2446594) (← links)
• Cooperative production under diminishing marginal returns: interpreting fixed-path methods (Q2460082) (← links)
• The worst absolute surplus loss in the problem of commons: random priority versus average cost (Q2460223) (← links)
• Strategy-proof rules for an excludable public good (Q2629521) (← links)
• Cost sharing in two-sided markets (Q2670930) (← links)
• Collusion-proof mechanisms for multi-unit procurement (Q2685840) (← links)
• A parametric worst-case approach to fairness in cooperative games with transferable utility (Q2699972) (← links)
• Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
• Sharing Rewards Among Strangers Based on Peer Evaluations (Q2963448) (← links)
• Cost sharing over combinatorial domains : Complement-free cost functions and beyond (Q5075756) (← links)
• On Groves mechanisms for costly inclusion (Q6076923) (← links)
• Characterization of Vickrey auction with reserve price for multiple objects (Q6086124) (← links)
• Combinatorial reallocation mechanisms (Q6130328) (← links)