I am interested in research projects combining algorithms and computer science with economics and social science. In particular, I am interested in algorithms for fair division and market design. Here are some potential projects I am particularly interested in:

Fair division algorithms in realestate projects. Currently, apartments are divided by lottery and/or protection… There are better ways and I would like to check how they can be implemented.

Fair division of time of public servants (e.g. a politicians) among the various topics that require their attention.

Fair division of state budget among citizens and citizengroups.

Fair division of cabinet ministries among parties. Save precious time in constructing a governemt!

Fair division of electricity among households, in villages in which the power supply is less than the demand.

Experiments in fair division. Recently, together with Josue Ortega and Maria Kyropoulou, we wrote a paper describing a lab experiment about manipulation and envy in cakecutting. I will be happy to extend this research to other division procedures and settings.
Open Questions in Fair Division
These are problems I studied in the past and found some results, but some other results are missing. If you can find the missing results, I will be very happy to know.

Fair allocation of indivisible goods with diffeent entitlements: Two agents with different incomes have to divide a set of indivisible items. Does a competitive equilibrium exist for almost all incomevectors? This question was raised by Babaioff and Nisan and TalgamCohen. My AAMAS 2018 paper solves some related problems, but the case of two additive agents is still open. The case of three additive agents is open too; for four additive agents, the above paper shows that the answer is no.

Fair cakecutting with different entitlements: What is the smallest number of cuts required? This working paper has some preliminary results. The smallest open case is 3 agents with entitlementratios 1:2:4; at least 4 and at most 6 cuts are needed. This is a combinatorics question that may be related to measure theory.

Fair division of an archipelago: when an archipelago of m islands is divided among n agents, and each agent needs to get at most k disconnected pieces, what is the largest value that can be guaranteed to each agent? This working paper has some preliminary results. The smallest open case is 3 islands, 3 agents and 2 pieces per agent. At least 2/7 and at most 1/3 can be guaranteed. This, too, is mainly a combinatorics question.

Connected envyfree and proportional cakecutting with free disposal: can it be done in bounded time? Our TALG 2016 paper “Waste Makes Haste” presents the status as of 8/2016, and proves that the answer is yes for 3 agents. The smallest open case is 4 agents. The Wikipedia page on envyfree cakecutting gives some background. This is mainly an algorithmic question.

Connected envyfree allocation of a partlyburnt cake: does it exist for any number of agents? My AAMAS 2018 paper “Fairly Dividing a Cake after Some Parts were Burnt in the Oven” shows that the answer is yes for 3 agents. Frédéric Meunier and Shira Zerbib show that the answer is yes when the number of agents is 4 or prime. It is still open whether the answer is yes for all n. The smallest open case is n=6. The proofs combine combinatorics and algebraic topology.

Democratic fair allocation of indivisible goods: some indivisible items should be divided among two groups of agents. What is the largest fraction of agents in each group, that can be guaranteed at least one of their two favorite items? An IJCAI 2018 paper with Warut Suksompong proves that the answer is between 3/5 and 2/3. The exact fraction is still a mystery (that paper contains other related open questions).

Redividing land: when land is redivided, such as in a landreform, what is the largest fraction of proportionality compatible with democratic ownership? My IJCAI 2018 paper proves that the fraction is at least 1/3 for onedimensional intervals, at least 1/4 for rectangles, and at least 1/5 for twodimensional convex objects. The exact fraction in these and other natural settings is still open. The problem combines geometry and combinatorics.

Given a collection of points in the plane, what is the largest possible collection of pairwisedisjoint wetsquares? This draft presents the question formally and gives some directions. Our fairandsquare papers (extended abstract and full preprint) present the economic motivation. This is mainly a question in discrete geometry.
Open Questions in Mechanism Design
I developed several mechanisms for doublesided markets; I will be very happy to know if they can be extended to more general settings. In particular:

In a singlecommodity singleunit market, our SBBA mechanism is priorfree, truthful, stronglybudgetbalanced and asymptoticallyefficient, but it is randomized. Is there a deterministic mechanism that attains the same properties?

In a singlecommodity multiunit market, our MUDA mechanism is priorfree, truthful, budgetbalanced and asymptoticallyefficient, but it works only when all traders have submodular valuations (with decreasing marginal returns). Is there a mechanism that attains the same properties with supermodular traders (with increasing marginal returns)?

In a multicommodity multiunit market, our MIDA mechanism is priorfree, truthful, budgetbalanced and asymptoticallyefficient, but it works only when each seller specializes in a singlecommodity. Is there a mechanism that attains the same properties when both buyers and sellers can trade multiple commodities?

We have a mechanism that makes an appraiser work for you and report the true value of an object. However, it is truthful only when the cost of computing the information is sufficiently small. For example, when the prior distribution of the value is uniform, the cost should be at most 1/4 of the expected value. Is there a truthful mechanism for eliciting the information when the cost is higher?