Corpus ID: 235421649

Online Learning of Competitive Equilibria in Exchange Economies

  title={Online Learning of Competitive Equilibria in Exchange Economies},
  author={Wenshuo Guo and Kirthevasan Kandasamy and Joseph Gonzalez and Michael I. Jordan and Ion Stoica},
The sharing of scarce resources among multiple rational agents is one of the classical problems in economics. In exchange economies, which are used to model such situations, agents begin with an initial endowment of resources and exchange them in a way that is mutually beneficial until they reach a competitive equilibrium (CE). CE allocations are Pareto efficient and fair. Consequently, they are used widely in designing mechanisms for fair division. However, computing CEs requires the knowledge… Expand

Figures from this paper


Online Learning Demands in Max-min Fairness
We describe mechanisms for the allocation of a scarce resource among multiple users in a way that is efficient, fair, and strategy-proof, but when users do not know their resource requirements. TheExpand
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
The Virtual Index Mechanism is presented, an optimal dynamic mechanism, which maximizes the (long term) {\em virtual surplus} using the classical Gittins algorithm, taking incentives into account. Expand
Learning Competitive Equilibrium
We consider a pure exchange economy repeated from a fixed endowment for an indefinite number of periods and posit a learning rule which directs convergence to competitive equilibrium. In each periodExpand
Competitive Equilibria with Indivisible Goods and Generic Budgets
It is shown that for agents with equal budgets, making the budgets generic -- by adding vanishingly small random perturbations -- ensures the existence of an equilibrium, and that it exists in cases of interest (like when the agents have identical preferences) if budgets are perturbed. Expand
Fair allocation without trade
A competitive market equilibrium achieves the desired notion of fairness, thereby obtaining a polynomial-time algorithm that computes such a fair allocation and solving the main open problem raised by Dolev et al. Expand
An Efficient Dynamic Mechanism
This paper constructs an efficient, budget-balanced, Bayesian incentive-compatible mechanism for a general dynamic environment with quasilinear payoffs in which agents observe private information andExpand
Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
Combinatorial allocation involves assigning bundles of items to agents when the use of money is not allowed. Course allocation is one common application of combinatorial allocation, in which theExpand
Fair Allocation through Competitive Equilibrium from Generic Incomes
This work considers agents who are a priori non-equal (like different-sized foodbanks); it forms a new notion of fair allocation among non-equals satisfied by CEGI, and shows existence in cases of interest (like when the agents have identical preferences). Expand
Oracle-Efficient Online Learning and Auction Design
We consider the design of computationally efficient online learning algorithms in an adversarial setting in which the learner has access to an offline optimization oracle. We present an algorithmExpand
Asymmetric Information, Incentives and Intrafirm Resource Allocation
This paper considers the question: How should a firm allocate a resource among divisions when the productivity of the resource in each division is known only to the division manager? Obviously if theExpand