Algorithmics, Social choice, Market Design, and Other Topics

The accepted paper list! http://www.optimalmatching.com/MATCHUP2015/accepted-abstracts.html

The website of EXPLORE 2015 is now up! Main information: EXPLORE-2015: The 2nd Workshop on Exploring Beyond the Worst Case in Computational Social Choice To be held at the 14th Conference for Autonomous Agents and Multi-Agent Systems, AAMAS 2015. May 4-8, 2015 Istanbul, Turkey http://www.explore-2015. preflib.org/ Computational Social Choice (ComSoc) is a rapidly developing field at the intersection of computer science, economics, social choice, and political science. Many, often disjoint, groups of researchers both outside and within computer science study group decision making and preference aggregation. The computer science view of social choice focuses on computational aspects of social choice and importing ideas from social choice into computer science, broadly. While the surge of research in this area has created dramatic benefits in the areas of market matchings, recommendation systems, and preference aggregation, much of the ComSoc community remain...

The Economist reports about this recent breakthrough !

[Taken from http://wine2014.amss.ac.cn/dct/page/70014] December 14: Location of Conference Venue: South Building of AMSS 9:00am ‐ 17:00pm: Registration (Location:the 2 nd floor near N204) 10:00am ‐ 12:00pm: Tutorial Nir Gavish. Computation of equilibrium bidding strategies in asymmetric first price auctions . (Location: N204) 1:30 ‐ 3:30pm: Tutorial (Location: N204) Kamal Jain. Theoretical Analysis of Business Models . 3:30 ‐ 4:00pm: Coffee break 4:00 ‐ 6:00pm: Tutorial (Location: N204) Martin Gairing. Quantifying the Efficiency of Congestion Games 6:00pm: End of Tutorials day.  December 15: 8:00am ‐ 12:00am: Registration (Location:the 2 nd floor near N204) 8:50 ‐ 9:00am: Opening (Location: N204) 9:00am: Invited Talk by Robert Aumann 10:00am: Coffee Break 10:30am: Session 1 (Location: N204) 10:30 ‐ 10:54:Shaddin Dughmi, Li Han and Noam Nisan. Sampling ...

The Game Theory Group at Polytechnic of Milano has a web page, with interesting info for game theorists :  http://www.gametheory.polimi.it/

[Hat tip: The Guardian ]

Image taken from http://www.divorceny.com Fair allocation of objects is one of the most pressing issues faced by society. “Fairness” is a prickly topic with people coming up with different notions of what fairness should mean . One of the most established notions of fairness is envy-freeness  which requires that no agent should prefer another agent’s allocation. EF (Envy-freeness)  by itself does not guarantee desirable allocations. For example, an allocation which leaves agents empty-handed is envy-free as well! Thus, we would like to allocate all the objects to the agents i.e., the assignment should be complete. Unfortunately, there may not exist a complete and envy-free assignment. This can illustrated by consider the setting in which there is exactly one object. Then, any agent who does not get the object will be envious of the agent who gets the object. In view of this predicament, in a recent issue of Notices of the AMS , Brams, Kilgour and Klamler (2014...