Generalized assignment problem: Truthful mechanism design without money

Fadaei, Salman; Bichler, Martin

doi:10.1016/j.orl.2016.12.003

Cited by 8 publications

(4 citation statements)

References 17 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In Table 5 selected test problems and determined parameters are given. In the selected problems, U [15,25], number of agent is 10 and number of jobs is 200. The largest problem size was preferred.…”

Section: Computational Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem

Bektur¹

2019

Int. J. Optim. Control, Theor. Appl. (IJOCTA)

View full text Add to dashboard Cite

In this study, a multi-resource agent bottleneck generalized assignment problem (MRBGAP) is addressed. In the bottleneck generalized assignment problem (BGAP), more than one job can be assigned to an agent, and the objective function is to minimize the maximum load over all agents. In this problem, multiple resources are considered and the capacity of the agents is dependent on these resources and it has minimum two indices. In addition, agent qualifications are taken into account. In other words, not every job can be assignable to every agent. The problem is defined by considering the problem of assigning jobs to employees in a firm. BGAP has been shown to be NP- hard. Consequently, a multi-start iterated tabu search (MITS) algorithm has been proposed for the solution of large-scale problems. The results of the proposed algorithm are compared by the results of the tabu search (TS) algorithm and mixed integer linear programming (MILP) model.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

“…Chakravarthy et al [24], proposed a heuristic algorithm for bottleneck generalized assignment problem. For a strategic variant of GAP, approximation algorithm is proposed by Fadaei and Bichler [25]. Detailed information for GAP can be found in the literature review by Öncan [11].…”

Section: Introductionmentioning

confidence: 99%

A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem

Bektur¹

2019

Int. J. Optim. Control, Theor. Appl. (IJOCTA)

View full text Add to dashboard Cite

show abstract

“…Our work brings the idea of hiding manipulation from this literature to facility location, where it can be combined with complex preference structures and compared to the misreporting manipulation. We note that hiding parts of preferences is also well-studied in unweighted division and assignment problems (Fadaei and Bichler 2017).…”

Section: Related Workmentioning

confidence: 98%

The Surprising Power of Hiding Information in Facility Location

Hossain

Micha

Shah

2020

AAAI

View full text Add to dashboard Cite

Facility location is the problem of locating a public facility based on the preferences of multiple agents. In the classic framework, where each agent holds a single location on a line and can misreport it, strategyproof mechanisms for choosing the location of the facility are well-understood.We revisit this problem in a more general framework. We assume that each agent may hold several locations on the line with different degrees of importance to the agent. We study mechanisms which elicit the locations of the agents and different levels of information about their importance. Further, in addition to the classic manipulation of misreporting locations, we introduce and study a new manipulation, whereby agents may hide some of their locations. We argue for its novelty in facility location and applicability in practice. Our results provide a complete picture of the power of strategyproof mechanisms eliciting different levels of information and with respect to each type of manipulation. Surprisingly, we show that in some cases hiding locations can be a strictly more powerful manipulation than misreporting locations.

show abstract

“…Problem iki amaçlıdır. Amaçlardan ilki (6) ajan yüklerinin kareleri toplamının enküçüklenmesi iken, diğer amaç (7) işlerin atandığı toplam ajan sayısını enküçüklemektir. Kısıt (1) ajanların kapasite kısıtıdır, kısıt (2) her işin bir ajana atanmasını garantilemektedir.…”

Section: Problem Tanimi Ve Matemati̇ksel Model (Problem Definition An...unclassified

A Simulated Annealing Algorithm for the Multi Resource Generalized Assignment Problem with Eligibility Constraint

Erten

Saraç

Özçelik

2021

Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım Ve Teknoloji

View full text Add to dashboard Cite

show abstract

Generalized assignment problem: Truthful mechanism design without money

Cited by 8 publications

References 17 publications

A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem

A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem

The Surprising Power of Hiding Information in Facility Location

A Simulated Annealing Algorithm for the Multi Resource Generalized Assignment Problem with Eligibility Constraint

Contact Info

Product

Resources

About