Timothy Highley

According to our database1, Timothy Highley authored at least 10 papers between 2009 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Carry-Over Lottery Allocation: Practical Incentive-Compatible Drafts.
CoRR, February, 2026

2022
Using Information Structure Design to Reduce Bribery.
J. Comput. Sci. Coll., 2022

2021
Checkpoint variations for deep Q-learning in reconnaissance blind chess.
J. Comput. Sci. Coll., 2021

2020
Dealing with uncertainty: a PiecewiseGrid agent for reconnaissance blind chess.
J. Comput. Sci. Coll., 2020

2019
The First International Competition in Machine Reconnaissance Blind Chess.
Proceedings of the NeurIPS 2019 Competition and Demonstration Track, 2019

2018
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent.
Discret. Math. Theor. Comput. Sci., 2018

2016
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph (TROPICAL EXCHANGE) is NP-Complete.
CoRR, 2016

2015
An approach to the fairy tale card game: a rotating sets competitive knapsack problem with strongly stochastic rewards and item availability.
J. Comput. Sci. Coll., 2015

2010
Granularity of weighted averages and use of rate statistics in AggPro.
Proceedings of the 2010 Winter Simulation Conference, 2010

2009
Empirical Analysis of Case-Editing Approaches for Numeric Prediction.
Proceedings of the Innovations in Computing Sciences and Software Engineering, 2009


  Loading...