Search Results for author:
Found 5 papers, 1 papers with code
The Complexity of Envy-Free Graph Cutting
The problem is NP-complete, and we analyze its complexity with respect to two natural complexity measures: the number of agents and the number of edges in the graph.
Some coordination problems are harder than others
Objectives (i) and (iii) are tractable problems in pure coordination games, but for anti-coordination games are NP-hard.
Optimizing Reachability Sets in Temporal Graphs by Delaying
The second, imposes independent delays on the time labels of every edge of the graph. cWe provide a thorough investigation of the computational complexity of different objectives related to reachability sets when these operations are used.
Epidemiology
Data Structures and Algorithms
Computational Complexity
Computers and Society
Social and Information Networks
Crystal Structure Prediction via Oblivious Local Search
In addition, due to the chemical expertise involved in the parameter-tuning, these approaches can be {\em biased} towards previously-known crystal structures.
Computational Engineering, Finance, and Science
Learning Approximately Optimal Contracts
Furthermore, we show that when there are only two possible outcomes or the agent is risk-neutral, the algorithm's outcome approximates the optimal contract described in the classical theory.
