233 citations · 581 across the 28 of their papers we have counts for
7 papers · 1 filter
Robust Market Equilibria with Uncertain Preferences
Riley Murray, Christian Kroer, Alex Peysakhovich +1
The problem of allocating scarce items to individuals is an important practical question in market design. An increasingly popular set of mechanisms for this task uses the concept…
Scalable Fair Division for 'At Most One' Preferences
Christian Kroer, Alexander Peysakhovich
Allocating multiple scarce items across a set of individuals is an important practical problem. In the case of divisible goods and additive preferences a convex program can be used…
Fair Division Without Disparate Impact
Alexander Peysakhovich, Christian Kroer
We consider the problem of dividing items between individuals in a way that is fair both in the sense of distributional fairness and in the sense of not having disparate impact acr…
PyTorch-BigGraph: A Large-scale Graph Embedding System
Adam Lerer, Ledell Wu, Jiajun Shen +4
Graph embedding methods produce unsupervised node features from graphs that can then be used for a variety of machine learning tasks. Modern graphs, particularly in industrial appl…
Robust Multi-agent Counterfactual Prediction
Alexander Peysakhovich, Christian Kroer, Adam Lerer
We consider the problem of using logged data to make predictions about what would happen if we changed the `rules of the game' in a multi-agent system. This task is difficult becau…
Discovering Context Effects from Raw Choice Data
Arjun Seshadri, Alexander Peysakhovich, Johan Ugander
Many applications in preference learning assume that decisions come from the maximization of a stable utility function. Yet a large experimental literature shows that individual ch…
Computing large market equilibria using abstractions
Christian Kroer, Alexander Peysakhovich, Eric Sodomka +1
Computing market equilibria is an important practical problem for market design, for example in fair division of items. However, computing equilibria requires large amounts of info…