Note to recruiters

Note to recruiters: We are quite aware that recruiters, interviewers, VCs and other professionals generally perform a Google Search before they interview someone, take a pitch from someone, et cetera. Please keep in mind that not everything put on the Internet must align directly to one's future career and/or one's future product portfolio. Sometimes, people do put things on the Internet just because. Just because. It may be out of their personal interests, which may have nothing to do with their professional interests. Or it may be for some other reason. Recruiters seem to have this wrong-headed notion that if somebody is not signalling their interests in a certain area online, then that means that they are not interested in that area at all. It is worth pointing out that economics pretty much underlies the areas of marketing, strategy, operations and finance. And this blog is about economics. With metta, let us. by all means, be reflective about this whole business of business. Also, see our post on "The Multi-faceted Identity Problem".
Showing posts with label computer science. Show all posts
Showing posts with label computer science. Show all posts

Wednesday, July 18, 2012

Computer science tackles a 30 year old economics problem

From MIT news:

In 2007, the University of Chicago's Roger Myerson won the Nobel Memorial Prize in Economic Sciences — in part for research he had published, in 1981, on auction design. Using the tools of game theory, Myerson showed how to structure an auction for a single item such that if all the bidders adopted the bidding strategies in their best interest, the auctioneer would realize the greatest profit.

Myerson's work immediately raised a related question: What's the best way to organize an auction in which bidders are competing for multiple items? That question has stood for 30 years, but MIT computer scientists believe that they have now answered it. In a pair of recent papers, Constantinos Daskalakis, the X-Window Consortium Assistant Professor of Computer Science and Engineering at MIT, and his students Yang Cai and Matthew Weinberg describe an algorithm for finding an almost-perfect approximation of the optimal design of a multi-item auction. 

Wednesday, July 11, 2012

The manifest destiny of artificial intelligence

Artificial intelligence began with an ambitious research agenda: To endow machines with some of the traits we value most highly in ourselves—the faculty of reason, skill in solving problems, creativity, the capacity to learn from experience. Early results were promising. Computers were programmed to play checkers and chess, to prove theorems in geometry, to solve analogy puzzles from IQ tests, to recognize letters of the alphabet. Marvin Minsky, one of the pioneers, declared in 1961: “We are on the threshold of an era that will be strongly influenced, and quite possibly dominated, by intelligent problem-solving machines.”
Fifty years later, problem-solving machines are a familiar presence in daily life. Computer programs suggest the best route through cross-town traffic, recommend movies you might like to see, recognize faces in photographs, transcribe your voicemail messages and translate documents from one language to another. As for checkers and chess, computers are not merely good players; they are unbeatable. Even on the television quiz show Jeopardy, the best human contestants were trounced by a computer.
In spite of these achievements, the status of artificial intelligence remains unsettled. We have many clever gadgets, but it’s not at all clear they add up to a “thinking machine.” Their methods and inner mechanisms seem nothing like human mental processes.
Perhaps we should not be bragging about how smart our machines have become; rather, we should marvel at how much those machines accomplish without any genuine intelligence.