Sign in

Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores.

Shant BoodaghiansBhaskar Ray ChaudhuryRuta Mehta
Published in: SODA (2022)
Keyphrases
  • computational cost
  • learning algorithm
  • orders of magnitude
  • optimization problems
  • recently developed
  • upper bound
  • worst case
  • benchmark datasets
  • combinatorial optimization
  • computational problems