Algorithmics, Social choice, Market Design, and Other Topics

G. H. Hardy was one of the most well-known pure mathematicians. His book   A Mathematician's Apology remains a classic piece of literature attempting to explain mathematics to lay people. Many sentences from the book became famous quotes .  If one reads the book carefully, one can already find some allusions to cricket. For example, Hardy wonders aloud about would have happened had Bradman the cricketing legend had been a poet (Page 5). Haider Riaz Khan has picked up on Hardy's interest in cricket and written an interesting piece on the topic .

The accepted paper list is now available : Regular papers: 1.    A Near-Optimal Mechanism for Impartial Selection by Nicolas Bousquet, Sergey Norin and Adrian Vetta. 2.    Optimal Cost-Sharing in Weighted Congestion Games Vasilis Gkatzelis by Konstantinos Kollias and Tim Roughgarden 3.    Truthful Multi-unit Procurements with Budgets by Hau Chan and Jing Chen 4.    A Truthful-in-expectation Mechanism for the Generalized Assignment Problem by Salman Fadaei and Martin Bichler 5.    Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria by Matthias Feldotto, Martin Gairing and Alexander Skopalik 6.    Limiting Price Discrimination when Selling Products with Positive Network Externalities by Luděk Cigler, Wolfgang Dvořák, Monika Henzinger and Martin Starnberger 7.    The Shapley Value in Knapsack Budgeted Games by Smriti Bhagat, Anthony Kim, S. Muthukrishnan and Udi We...

A short and amusing video showing how approval voting is better than the ubiquitous plurality voting (Hat tip to Nick Mattei!)

Congratulations to Iranian Maryam Mirzakhani from Stanford University who is the first woman to win the Fields Medal. Her Fields Medal citation includes the following: Maryam Mirzakhani has made striking and highly original contributions to geometry and dynamical systems. Her work on Riemann surfaces and their moduli spaces bridges several mathematical disciplines—hyperbolic geometry, complex analysis, topology, and dynamics—and influences them all in return. She gained widespread recognition for her early results in hyperbolic geometry, and her most recent work constitutes a major advance in dynamical systems. Here's an interesting biographical profile on Maryam.

Pioneering mathematician Harold Kuhn has passed away this week . Kuhn was known for various contributions: Karush–Kuhn–Tucker conditions (for a solution in nonlinear programming to be optimal); Kuhn's theorem (that relates perfect recall, mixed and unmixed strategies and their expected payoffs); and the Hungarian method for computing the minimum cost perfect matching of a bipartite graph. I recall attending Kuhn's plenary lecture at EURO 2010 in Lisbon where he gave a charming talk about the history of the Hungarian method and the recent discovery of how Carl Gustav Jacobi had already solved the assignment problem in the 19th century. Kuhn gave a detailed history of the other figures such as Dénes Konig and Jenó Egerváry who all played their part in the development of ideas related to the Hungarian Method.

Cake cutting started off as a topic of mathematical curiosity but has become a full-fledged topic within the field of " fair division " because of its ability to abstractly capture settings in which a heterogeneous divisible good is to be allocated among multiple people. The main goal is to identify methods to cut the cake that are as fair and welfare maximizing as possible. The field originated in the 1940's due to to work of Polish mathematicians Steinhaus, Knaster & Banach. Recently, a video has been doing the rounds that suggests that a formal study of cake cutting dates even earlier than the 1940's. The video discusses a Nature letter by Francis Galton dated 1906 regarding the optimal method to cut the cake so as to minimize the exposed surface that may become dry. For those who are interested to see Galton's actual letter, here it is:

Location: Room B424 , Level 4, ‘B Block’, UTS Business School 1-59 Quay Street, Haymarket, Sydney, Australia July 24, 2014  (9am - 4:30pm) Roy Green, Dean of the UTS Business School. Welcome John Ledyard (California Institute of Technology) “A Simple Buy‐back Auction for Fisheries Management” with Guillerme Freitas and Theodore Groves  Leslie M. Marx (Duke University) “Equilibrium Bid Strategies in an Auction with Bidder Preferences and Resale” with Simon Loertscher Jun Zhang (University of Technology, Sydney) “Information Disclosure In Contests: A Bayesian Persuasion Approach” with Junjie Zhou Murali Agastya (University of Sydney) “On Efficient Partnership Dissolution” with Oleksii Birulin Paul Pezanis ‐ Christou (University of Adelaide)  “Supply information policies in sequential and simultaneous high‐bid auctions” with Nobuyuki Hanaki and Tibor Neugebaeur Tom Wilkening (University of Melbourne) “A Long Way Comi...