FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W142056584> ?p ?o ?g. }

• W142056584 abstract "Many challenges in operations research involve optimization. In particular, scheduling treats the optimal planning of tasks. This thesis focusses on machine scheduling models, where a number of tasks, called jobs, need to be scheduled on one or more machines. The outcome is determined by which job is scheduled on which machine and in what order the jobs will be processed by those machines.Classic optimization models often assume the availability of perfect information and the possibility of centralized control. Algorithmic game theory deals with optimization models, where such assumptions are dropped. This leads to settings where jobs are considered players of a game, that is designed by the optimizer. The rules of such a game, called the mechanism, are sometimes fixed in which case a worst-case analysis of the system performance, called price of anarchy, can be done. If such a mechanism is not fixed, a mechanism can be designed to perform optimally. This thesis treats several classic scheduling models in different game theoretic settings. First is an analysis of the price of anarchy for the related machines scheduling model with sum of completion times objective and selfish jobs. Both an upper bound and a lower bound are given, as well as a new characterization of optimal solutions.Second, the optimal mechanism design for the two-dimensional scheduling mechanism design problem is treated. While for single-dimensional mechanism design it is well known that optimal solutions can be found efficiently for most settings, the knowledge of optimal mechanism design for multi-dimensional problems is limited. The results from this thesis show that for the scheduling problem with two-dimensional private types, the optimal, randomized mechanism can in fact be found efficiently with the use of LP-techniques. Furthermore, the resulting interim allocations can be decomposed into a lottery over deterministic schedules.While randomized mechanisms can be found efficiently, finding deterministic mechanisms still remains a challenge. This thesis also shows that the use of heuristics based on the so-called type graph is a promising approach toward applying simple, efficient mechanisms." @default.
• W142056584 created "2016-06-24" @default.
• W142056584 creator A5010930168 @default.
• W142056584 date "2014-12-12" @default.
• W142056584 modified "2023-10-01" @default.
• W142056584 title "Mechanisms for scheduling games with selfish players" @default.
• W142056584 cites W142791843 @default.
• W142056584 cites W1486935562 @default.
• W142056584 cites W1488422606 @default.
• W142056584 cites W1488995906 @default.
• W142056584 cites W1526035966 @default.
• W142056584 cites W1526250527 @default.
• W142056584 cites W1539141971 @default.
• W142056584 cites W1548540712 @default.
• W142056584 cites W1557860566 @default.
• W142056584 cites W1719407338 @default.
• W142056584 cites W1815705819 @default.
• W142056584 cites W1826494558 @default.
• W142056584 cites W1909697184 @default.
• W142056584 cites W1966132455 @default.
• W142056584 cites W1966696868 @default.
• W142056584 cites W1975442866 @default.
• W142056584 cites W1976802195 @default.
• W142056584 cites W1982325951 @default.
• W142056584 cites W1983127118 @default.
• W142056584 cites W19838944 @default.
• W142056584 cites W1988328380 @default.
• W142056584 cites W1989792334 @default.
• W142056584 cites W1991528957 @default.
• W142056584 cites W1992734168 @default.
• W142056584 cites W2011039300 @default.
• W142056584 cites W2012329067 @default.
• W142056584 cites W2015429465 @default.
• W142056584 cites W2022731279 @default.
• W142056584 cites W2028342743 @default.
• W142056584 cites W2028876862 @default.
• W142056584 cites W2029050771 @default.
• W142056584 cites W2035575256 @default.
• W142056584 cites W2036291901 @default.
• W142056584 cites W2038017315 @default.
• W142056584 cites W2043072159 @default.
• W142056584 cites W2053913299 @default.
• W142056584 cites W2054965643 @default.
• W142056584 cites W2057938496 @default.
• W142056584 cites W2067050450 @default.
• W142056584 cites W2075265959 @default.
• W142056584 cites W2076551060 @default.
• W142056584 cites W2078544711 @default.
• W142056584 cites W2080656989 @default.
• W142056584 cites W2092438148 @default.
• W142056584 cites W2097025565 @default.
• W142056584 cites W2100440346 @default.
• W142056584 cites W2106614985 @default.
• W142056584 cites W2111714984 @default.
• W142056584 cites W2123325400 @default.
• W142056584 cites W2125537511 @default.
• W142056584 cites W2128059732 @default.
• W142056584 cites W2132022337 @default.
• W142056584 cites W2133243407 @default.
• W142056584 cites W2133880097 @default.
• W142056584 cites W2135783045 @default.
• W142056584 cites W2137906183 @default.
• W142056584 cites W2142027309 @default.
• W142056584 cites W2142236329 @default.
• W142056584 cites W2496227153 @default.
• W142056584 cites W2569059396 @default.
• W142056584 cites W27038116 @default.
• W142056584 cites W2914699946 @default.
• W142056584 cites W30074706 @default.
• W142056584 cites W2156744712 @default.
• W142056584 doi "https://doi.org/10.3990/1.9789036538275" @default.
• W142056584 hasPublicationYear "2014" @default.
• W142056584 type Work @default.
• W142056584 sameAs 142056584 @default.
• W142056584 citedByCount "0" @default.
• W142056584 crossrefType "dissertation" @default.
• W142056584 hasAuthorship W142056584A5010930168 @default.
• W142056584 hasBestOaLocation W1420565841 @default.
• W142056584 hasConcept C111472728 @default.
• W142056584 hasConcept C111919701 @default.
• W142056584 hasConcept C126255220 @default.
• W142056584 hasConcept C126285488 @default.
• W142056584 hasConcept C134306372 @default.
• W142056584 hasConcept C137836250 @default.
• W142056584 hasConcept C138885662 @default.
• W142056584 hasConcept C144237770 @default.
• W142056584 hasConcept C153517567 @default.
• W142056584 hasConcept C162324750 @default.
• W142056584 hasConcept C177142836 @default.
• W142056584 hasConcept C188466206 @default.
• W142056584 hasConcept C202556891 @default.
• W142056584 hasConcept C206729178 @default.
• W142056584 hasConcept C33923547 @default.
• W142056584 hasConcept C41008148 @default.
• W142056584 hasConcept C55416958 @default.
• W142056584 hasConcept C556758197 @default.
• W142056584 hasConcept C68387754 @default.
• W142056584 hasConcept C69663246 @default.
• W142056584 hasConcept C77553402 @default.
• W142056584 hasConcept C82149807 @default.

• next