Arrow Research search

Author name cluster

Adrian Goldwaser

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

AAAI Conference 2020 Conference Paper

Deep Reinforcement Learning for General Game Playing

  • Adrian Goldwaser
  • Michael Thielscher

General Game Playing agents are required to play games they have never seen before simply by looking at a formal description of the rules of the game at runtime. Previous successful agents have been based on search with generic heuristics, with almost no work done into using machine learning. Recent advances in deep reinforcement learning have shown it to be successful in some two-player zero-sum board games such as Chess and Go. This work applies deep reinforcement learning to General Game Playing, extending the AlphaZero algorithm and finds that it can provide competitive results.

JAIR Journal 2018 Journal Article

Optimal Torpedo Scheduling

  • Adrian Goldwaser
  • Andreas Schutt

We consider the torpedo scheduling problem in steel production, which is concerned with the transport of hot metal from a blast furnace to an oxygen converter. A schedule must satisfy, amongst other considerations, resource capacity constraints along the path and the locations traversed as well as the sulfur level of the hot metal. The goal is first to minimize the number of torpedo cars used during the planning horizon and second to minimize the time spent desulfurizing the hot metal. We propose an exact solution method based on Logic based Benders Decomposition using Mixed-Integer and Constraint Programming, which optimally solves and proves, for the first time, the optimality of all instances from the ACP Challenge 2016 within 10 minutes. In addition, we adapted our method to handle large-scale instances and instances with a more general rail network. This adaptation optimally solved all challenge instances within one minute and was able to solve instances of up to 100,000 hot metal pickups.

AAMAS Conference 2017 Conference Paper

Coalitional Exchange Stable Matchings in Marriage and Roommate Markets

  • Haris Aziz
  • Adrian Goldwaser

We consider the stable roommates problem with respect to the stability based on exchange of agents. We present three natural variants of coalitional exchange stability and identify the relations between them. We also present a number of impossibility results. In particular, we show that even a (standard) exchange stable matching may not exist for dichotomous preferences. We prove that exchange stability has a fundamental incompatibility with weak Pareto optimality. We also prove that an exchange stable matching mechanism cannot be strategyproof.

v2026.09.13