146 research outputs found
Water transport on infinite graphs
If the nodes of a graph are considered to be identical barrels â featuring different water levels â and the edges to be (locked) waterâfilled pipes in between the barrels, consider the optimization problem of how much the water level in a fixed barrel can be raised with no pumps available, that is, by opening and closing the locks in an elaborate succession. This model is related to an opinion formation process, the soâcalled Deffuant model. We consider the initial water profile to be given by i.i.d. unif(0,1) random variables, investigate the supremum of achievable water levels at a given node â or to be more precise, the support of its distribution â and ask in which settings it becomes degenerate, that is, reduces to a single value. This turns out to be the case for all infinite connected quasiâtransitive graphs, with exactly one exception: the twoâsided infinite path
An AGI Modifying Its Utility Function in Violation of the Strong Orthogonality Thesis
An artificial general intelligence (AGI) might have an instrumental drive to modify its utility function to improve its ability to cooperate, bargain, promise, threaten, and resist and engage in blackmail. Such an AGI would necessarily have a utility function that was at least partially observable and that was influenced by how other agents chose to interact with it. This instrumental drive would conflict with the strong orthogonality thesis since the modifications would be influenced by the AGI\u27s intelligence. AGIs in highly competitive environments might converge to having nearly the same utility function, one optimized to favorably influencing other agents through game theory. Nothing in our analysis weakens arguments concerning the risks of AGI
- âŠ