Sequencing games

DOI10.1016/0377-2217(89)90427-XMaRDI QIDQ1121813zbMATH OpenOpenAlexFDO

Authors Imma J. Curiel, Giorgio Pederzoli, Stef Tijs

Publication date 1989

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(89)90427-x

zbMATH Keywords

linear cost functionsqueueingSequencing situationsShapley values

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Cooperative games (91A12)

Review text

Sequencing situations with linear cost functions are considered. Cooperative game theory is applied to analyze these situations. The convexity of these games is verified, and the Shapley values are determined.

Recommendations

• Sequencing games with repeated players
• Sequencing games with controllable processing times
• On games corresponding to sequencing situations with ready times
• scientific article; zbMATH DE number 1248150
• On a new class of parallel sequencing situations and related games

Cites work

• Cores of convex games
• scientific article; zbMATH DE number 3733695 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• scientific article; zbMATH DE number 3078999 (Why is no real title available?)
• Permutation games: Another class of totally balanced games
• The \(\tau\)-value, the core and semiconvex games

Cited in

(only showing first 100 items - show all)

• Comments on: Transversality of the Shapley value
• Convex games with an infinite number of players and sequencing situations
• Convex interval games
• Processing games with restricted capacities
• Flow-shops with a dominant machine
• A necessary and sufficient condition for the convexity in oligopoly games
• Operations research games: A survey. (With comments and rejoinder)
• On the core of routing games
• Restricted component additive games
• Convex fuzzy games and participation monotonic allocation schemes.
• NTU PERT games
• A cooperative approach to service booking and scheduling in cloud manufacturing
• Cooperation and sharing costs in a tandem queueing network
• Multiple-machine scheduling with learning effects and cooperative games
• Shapley value for parallel machine sequencing situation without initial order
• From hierarchies to levels: new solutions for games with hierarchical structure
• Reordering an existing queue
• Capacity allocation games without an initial sequence
• On the convexity of step out-step in sequencing games
• Self-interest and equity concerns: a behavioural allocation rule for operational problems
• Cost allocation in rescheduling with machine unavailable period
• Solving a two-agent single-machine scheduling problem considering learning effect
• Incomplete information and multiple machine queueing problems
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• Compromise values in cooperative game theory
• Cooperative games with stochastic payoffs
• On the balancedness of multiple machine sequencing games
• Characterizing convexity of games using marginal vectors
• -component additive games
• On games corresponding to sequencing situations with ready times
• A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games
• Minimum cost spanning tree games and spillover stability
• Values and potential of games with cooperation structure
• Games in sequencing situations with externalities
• On optimal mechanism design for a sequencing problem
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• Optimization implementation of solution concepts for cooperative games with stochastic payoffs
• Sequencing grey games
• Open shop scheduling games
• Sequencing situations and games with non-linear cost functions under optimal order consistency
• Monotonic stable solutions for minimum coloring games
• On the cooperation of recycling operations
• On interactive sequencing situations with exponential cost functions
• Two-agent scheduling with rejection on a single machine
• Compensation rules for multi-stage sequencing games
• On proper Shapley values for monotone TU-games
• Partitioning sequencing situations and games
• Cost sharing in a job scheduling problem
• Recent developments in the queueing problem
• Comments on: ``Recent developments in the queueing problem
• Production scheduling with subcontracting: the subcontractor's pricing game
• Approximating the least core value and least core of cooperative games with supermodular costs
• Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values
• Constrained core solutions for totally positive games with ordered players
• Multi-agent scheduling on a single machine with max-form criteria
• Core stability in chain-component additive games
• Sequencing games without initial order
• Balancedness of multiple machine sequencing games revisited
• A pessimistic approach to the queueing problem
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Sharing costs in highways: a game theoretic approach
• Job scheduling, cooperation, and control
• Highway games on weakly cyclic graphs
• On the convexity of independent set games
• Cooperative sequencing games with position-dependent learning effect
• A short proof of convexity of step-out-step-in sequencing games
• Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
• Subgroup additivity in the queueing problem
• Sequencing interval situations and related games
• Cooperation in one machine scheduling
• Stochastic linear programming games with concave preferences
• Step out-step in sequencing games
• A rescheduling and cost allocation mechanism for delayed arrivals
• RECURSIVE SEQUENCES IDENTIFYING THE NUMBER OF EMBEDDED COALITIONS
• Batch sequencing and cooperation
• Two-agent scheduling to minimize the total cost
• scientific article; zbMATH DE number 1248150 (Why is no real title available?)
• Balanced consistency and balanced cost reduction for sequencing problems
• On analyzing cost allocation problems: cooperation building structures and order problem representations
• Sequencing situations with just-in-time arrival, and related games
• Consistency and monotonicity in sequencing problems
• Multi-stage sequencing situations
• A generalization of the Shapley-ichiishi result
• On the convexity of games corresponding to sequencing situations with due dates.
• Competition and cooperation in linear production and sequencing processes
• The stable gain splitting rule for sequencing situations
• Convex and exact games with non-transferable utility
• In memoriam: Stef Tijs (1937--2023)
• Queueing games with an endogenous number of machines
• Efficient Shapley performance attribution for least-squares regression
• Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
• Generalized welfare lower bounds and strategyproofness in sequencing problems
• Political power on a line graph
• Sequencing situations with position-dependent effects under cooperation
• Fifty years of research in scheduling -- theory and applications
• Cooperative game theoretic results from the tuna fishing problem
• Axiomatic and strategic foundations for the pairwise equal splitting rule in sequencing problems with an initial queue
• An allocation rule for connection scheduling problems
• A bargaining game for implementing the equal gain splitting rule in sequencing situations
• Axiomatic and strategic justifications of the connected equal splitting rule in the reordering problem

This page was built for publication: Sequencing games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121813)