activity
20092019
most citedThe cooperative game theory foundations of network bargaining games

14 citations · 40 across the 11 of their papers we have counts for

collaborators

11 papers

cs.LG2019★ 2 cited

Real-time Travel Time Estimation Using Matrix Factorization

Ebrahim Badrestani, Behnam Bahrak, Ali Elahi +5

Estimating the travel time of any route is of great importance for trip planners, traffic operators, online taxi dispatching and ride-sharing platforms, and navigation provider sys…

cs.LG2019★ 1 cited

Proposing a Model for Predicting Passenger Origin-Destination in Online Taxi-Hailing Systems

Pouria Golshanrad, Hamid Mahini, Behnam Bahrak

Due to the significance of transportation planning, traffic management, and dispatch optimization, predicting passenger origin-destination has emerged as a crucial requirement for…

cs.LG2019

Short-term Demand Forecasting for Online Car-hailing Services using Recurrent Neural Networks

Alireza Nejadettehad, Hamid Mahini, Behnam Bahrak

Short-term traffic flow prediction is one of the crucial issues in intelligent transportation system, which is an important part of smart cities. Accurate predictions can enable bo…

cs.GT2016★ 1 cited

Price of Competition and Dueling Games

Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini +1

We study competition in a general framework introduced by Immorlica et al. and answer their main open question. Immorlica et al. considered classic optimization problems in terms o…

cs.GT2016★ 12 cited

From Duels to Battefields: Computing Equilibria of Blotto and Other Games

AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi +3

We study the problem of computing Nash equilibria of zero-sum games. Many natural zero-sum games have exponentially many strategies, but highly structured payoffs. For example, in…

cs.DS2015

Approximate Deadline-Scheduling with Precedence Constraints

Hossein Efsandiari, MohammadTaghi Hajiaghyi, Jochen Koenemann +3

We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasibl…