We present a dynamic agency model in which changes in the structure of a firm affect its value due to altered incentives. There may be disadvantages in merging two firms even when such a merger allows the internalization of externalities between the two firms. Merging, by making unprofitable certain decisions, increases the cost of inducing managers to exert effort. ∗Mailath and Postlewaite gra...

It's not surprisingly when entering this site to get the book. One of the popular books now is the using hard problems to create pseudorandom generators. You may be confused because you can't find the book in the book store around your city. Commonly, the popular book will be sold quickly. And when you have found the store to buy the book, it will be so hurt when you run out of it. This is why,...

Algorithm 3 details the process for incrementally computing term (13) for all xk. (The process for computing (14) is similar.) Computation of the full gradient is thus also an O(nm) operation. Using this technique, we can apply full-gradient first-order methods efficiently, including gradient projection and Frank-Wolfe. With an appropriate line-search method, gradient projection is guaranteed t...

Spikes form an interesting class of 3-connected matroids of branch-width 3. We show that some computational problems are hard on spikes with given matrix representations over infinite fields. Namely, the question whether a given spike is the free spike is co-NP -hard (though the property itself is definable in monadic second-order logic); and the task to compute the Tutte polynomial of a spike ...

Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary boolean expression true. For example, the boolean expression a & b is true iff the boolean variables a and b are true. Satisfiability is of interest to the logic, operations research, and computational complexity communities. Due to the emphasis of the logic community, traditional satisfiability algori...

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral norm; approximating an eigenvalue, eigenvector, singular vector, or the spectral norm; and determi...

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs. In higher dimensions, we show NP-completeness ...

It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P = NP). This paper shows that NP-complete problems can be summarized by at least one "order parameter", and that the hard problems occur at a cri t ical value of such a parameter. This cri t ical value separates two regions of char...

Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary boolean expression true. This paper compares a simulated annealing algorithm (SASAT) with GSAT (Selman et al., 1992), a greedy algorithm for solving satisfiability problems. GSAT can solve problem instances that are extremely difficult for traditional satisfiability algorithms. Results suggest that SAS...

This report is based on the work I have done for my Master Thesis project. The project as a whole consists of research done in the eld of evolutionary computation, and it is split into two distinct parts. The main theme is adaptive evolutionary algorithms. The rst part covers the research done on solving binary constraint satisfaction problems using adaptive evolutionary algorithms. This involv...