Allocation in Practice

How do we allocate scarcere sources? How do we fairly allocate costs? These are two pressing challenges facing society today. I discuss two recent projects at NICTA concerning resource and cost allocation. In the first, we have been working with FoodBank Local, a social startup working in collaboration with food bank charities around the world to optimise the logistics of collecting and distributing donated food. Before we can distribute this food, we must decide how to allocate it to different charities and food kitchens. This gives rise to a fair division problem with several new dimensions, rarely considered in the literature. In the second, we have been looking at cost allocation within the distribution network of a large multinational company. This also has several new dimensions rarely considered in the literature.Comment: To appear in Proc. of 37th edition of the German Conference on Artificial Intelligence (KI 2014), Springer LNC

Random Costs in Combinatorial Optimization

The random cost problem is the problem of finding the minimum in an exponentially long list of random numbers. By definition, this problem cannot be solved faster than by exhaustive search. It is shown that a classical NP-hard optimization problem, number partitioning, is essentially equivalent to the random cost problem. This explains the bad performance of heuristic approaches to the number partitioning problem and allows us to calculate the probability distributions of the optimum and sub-optimum costs.Comment: 4 pages, Revtex, 2 figures (eps), submitted to PR

Phase Transition in the Number Partitioning Problem

Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the pseudo-polynomiality of number partitioning. The phase diagram and the value of the typical ground state energy are calculated.Comment: minor changes (references, typos and discussion of results

Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random Satisfiability problem, and its application to stop-and-restart resolutions

A large deviation analysis of the solving complexity of random 3-Satisfiability instances slightly below threshold is presented. While finding a solution for such instances demands an exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. This exponentially small probability of easy resolutions is analytically calculated, and the corresponding exponent shown to be smaller (in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some theoretical basis to heuristic stop-and-restart solving procedures, and suggests a natural cut-off (the size of the instance) for the restart.Comment: Revtex file, 4 figure

Ocean circulation and Tropical Variability in the Coupled Model ECHAM5/MPI-OM

This paper describes the mean ocean circulation and the tropical variability simulated by the Max Planck Institute for Meteorology (MPI-M) coupled atmosphere–ocean general circulation model (AOGCM). Results are presented from a version of the coupled model that served as a prototype for the Intergovernmental Panel on Climate Change (IPCC) Fourth Assessment Report (AR4) simulations. The model does not require flux adjustment to maintain a stable climate. A control simulation with present-day greenhouse gases is analyzed, and the simulation of key oceanic features, such as sea surface temperatures (SSTs), large-scale circulation, meridional heat and freshwater transports, and sea ice are compared with observations. A parameterization that accounts for the effect of ocean currents on surface wind stress is implemented in the model. The largest impact of this parameterization is in the tropical Pacific, where the mean state is significantly improved: the strength of the trade winds and the associated equatorial upwelling weaken, and there is a reduction of the model’s equatorial cold SST bias by more than 1 K. Equatorial SST variability also becomes more realistic. The strength of the variability is reduced by about 30% in the eastern equatorial Pacific and the extension of SST variability into the warm pool is significantly reduced. The dominant El Niño–Southern Oscillation (ENSO) period shifts from 3 to 4 yr. Without the parameterization an unrealistically strong westward propagation of SST anomalies is simulated. The reasons for the changes in variability are linked to changes in both the mean state and to a reduction in atmospheric sensitivity to SST changes and oceanic sensitivity to wind anomalies

Optimization by Quantum Annealing: Lessons from hard 3-SAT cases

The Path Integral Monte Carlo simulated Quantum Annealing algorithm is applied to the optimization of a large hard instance of the Random 3-SAT Problem (N=10000). The dynamical behavior of the quantum and the classical annealing are compared, showing important qualitative differences in the way of exploring the complex energy landscape of the combinatorial optimization problem. At variance with the results obtained for the Ising spin glass and for the Traveling Salesman Problem, in the present case the linear-schedule Quantum Annealing performance is definitely worse than Classical Annealing. Nevertheless, a quantum cooling protocol based on field-cycling and able to outperform standard classical simulated annealing over short time scales is introduced.Comment: 10 pages, 6 figures, submitted to PR

Entropy-based analysis of the number partitioning problem

In this paper we apply the multicanonical method of statistical physics on the number-partitioning problem (NPP). This problem is a basic NP-hard problem from computer science, and can be formulated as a spin-glass problem. We compute the spectral degeneracy, which gives us information about the number of solutions for a given cost $E$ and cardinality $m$. We also study an extension of this problem for $Q$ partitions. We show that a fundamental difference on the spectral degeneracy of the generalized ($Q>2$) NPP exists, which could explain why it is so difficult to find good solutions for this case. The information obtained with the multicanonical method can be very useful on the construction of new algorithms.Comment: 6 pages, 4 figure

Oscillating Fracture in Rubber

We have found an oscillating instability of fast-running cracks in thin rubber sheets. A well-defined transition from straight to oscillating cracks occurs as the amount of biaxial strain increases. Measurements of the amplitude and wavelength of the oscillation near the onset of this instability indicate that the instability is a Hopf bifurcation