Pages that link to "Item:Q1810697"
From MaRDI portal
The following pages link to A characterization of the Shapley value in queueing problems (Q1810697):
Displayed 42 items.
- Axiomatic characterizations under players nullification (Q274053) (← links)
- Subgroup additivity in the queueing problem (Q296745) (← links)
- Auctioning and selling positions: a non-cooperative approach to queueing conflicts (Q406371) (← links)
- Coalitional games: monotonicity and core (Q421739) (← links)
- Characterizing the Shapley value in fixed-route traveling salesman problems with appointments (Q422367) (← links)
- On the number of blocks required to access the core (Q423887) (← links)
- Balanced consistency and balanced cost reduction for sequencing problems (Q427519) (← links)
- Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency (Q427528) (← links)
- Allocation rules for games with optimistic aspirations (Q457859) (← links)
- Weakly monotonic solutions for cooperative games (Q472188) (← links)
- Characterizations of pivotal mechanisms in the queueing problem (Q477794) (← links)
- Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games (Q480846) (← links)
- Consistency and monotonicity in sequencing problems (Q532511) (← links)
- The truncated core for games with upper bounds (Q532762) (← links)
- Axiomatizations of two types of Shapley values for games on union closed systems (Q535178) (← links)
- Group strategyproofness in queueing models (Q536097) (← links)
- Proportionate flow shop games (Q835628) (← links)
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925) (← links)
- Children crying at birthday parties. Why? (Q878403) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Sharing a river among satiable agents (Q952762) (← links)
- On the coincidence of the prenucleolus and the Shapley value (Q1005759) (← links)
- Processing games with restricted capacities (Q1041002) (← links)
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines (Q1939524) (← links)
- Games with a local permission structure: separation of authority and value generation (Q2015041) (← links)
- Egalitarian equivalence and strategyproofness in the queueing problem (Q2249580) (← links)
- Knapsack cost sharing (Q2254240) (← links)
- The average tree permission value for games with a permission tree (Q2256861) (← links)
- Computer science and decision theory (Q2271874) (← links)
- On proper Shapley values for monotone TU-games (Q2349419) (← links)
- Efficiency and compromise: a bid-offer-counteroffer mechanism with two players (Q2376075) (← links)
- Component efficient solutions in line-graph games with applications (Q2385112) (← links)
- Cost sharing in a job scheduling problem (Q2385122) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- A fair staff allocation rule for the capacity pooling of multiple call centers (Q2450697) (← links)
- Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values (Q2452118) (← links)
- Constrained core solutions for totally positive games with ordered players (Q2453492) (← links)
- Fairness and implementability in allocation of indivisible objects with monetary compensations (Q2457247) (← links)
- The optimistic \(TU\) game in minimum cost spanning tree problems (Q2458425) (← links)
- Cooperation in Markovian queueing models (Q2470108) (← links)
- No-envy in queueing problems (Q2505518) (← links)
- A pessimistic approach to the queueing problem (Q2507236) (← links)