Pages that link to "Item:Q4820880"

The following pages link to Cooperative facility location games (Q4820880):

Displaying 45 items.

• Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
• Non-cooperative capacitated facility location games (Q318924) (← links)
• Stability and fairness in models with a multiple membership (Q361803) (← links)
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
• Dynamic linear programming games with risk-averse players (Q526824) (← links)
• Equal-need sharing of a network under connectivity constraints (Q536106) (← links)
• Competitive cost sharing with economies of scale (Q547291) (← links)
• Buyer-supplier games: optimization over the core (Q627118) (← links)
• Cooperative games in facility location situations with regional fixed costs (Q628664) (← links)
• On the complexity of core, kernel, and bargaining set (Q650525) (← links)
• Collaborative transportation with overlapping coalitions (Q724085) (← links)
• Beyond Moulin mechanisms (Q834858) (← links)
• A note on duality gap in the simple plant location problem (Q858326) (← links)
• Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
• Non-cooperative facility location and covering games (Q964406) (← links)
• A cost-sharing method for an economic lot-sizing game (Q1015308) (← links)
• A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
• Strategic cooperation in cost sharing games (Q1939521) (← links)
• Allocating costs in set covering problems (Q2178140) (← links)
• Enforcing fair cooperation in production-inventory settings with heterogeneous agents (Q2241573) (← links)
• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
• Network strength games: the core and the nucleolus (Q2297643) (← links)
• Improving fairness in ambulance planning by time sharing (Q2327642) (← links)
• Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
• Complexity of constructing solutions in the core based on synergies among coalitions (Q2457626) (← links)
• Balancedness of edge covering games (Q2471286) (← links)
• The warehouse-retailer network design game (Q2514656) (← links)
• New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
• Noncooperative facility location games (Q2643786) (← links)
• Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
• OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES (Q2852565) (← links)
• AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING (Q2852569) (← links)
• COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
• Line Segment Facility Location in Weighted Subdivisions (Q3638446) (← links)
• Revenue Maximizing Markets for Zero-Day Exploits (Q4571149) (← links)
• Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
• (Q5002844) (← links)
• (Q5103838) (← links)
• Competitive Cost Sharing with Economies of Scale (Q5458541) (← links)
• Finding nucleolus of flow game (Q5896983) (← links)
• Cooperative decision-making for the provision of a locally undesirable facility (Q5964646) (← links)
• Cost allocation for less-than-truckload collaboration among perishable product retailers (Q5964847) (← links)
• Cooperative game‐theoretic features of cost sharing in location‐routing (Q6090481) (← links)
• Approximate core allocations for edge cover games (Q6122606) (← links)
• Approximate core allocations for edge cover games (Q6535804) (← links)