David L. Malec
University of Wisconsin-Madison
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by David L. Malec.
symposium on the theory of computing | 2013
Shuchi Chawla; Jason D. Hartline; David L. Malec; Balasubramanian Sivan
We study the makespan minimization problem with unrelated selfish machines under the assumption that job sizes are stochastic. We design simple truthful mechanisms that under different distributional assumptions provide constant and sublogarithmic approximations to expected makespan. Our mechanisms are prior-independent in that they do not rely on knowledge of the job size distributions. Prior-independent approximations were previously known only for the revenue maximization objective [13, 11, 26]. In contrast to our results, in prior-free settings no truthful anonymous deterministic mechanism for the makespan objective can provide a sublinear approximation [3].
behavioral and quantitative game theory on conference on future directions | 2010
Shuchi Chawla; Jason D. Hartline; David L. Malec; Balasubramanian Sivan
We consider the classical mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known distribution. In single-parameter settings (i.e., where each agents preference is given by a single private value for being served and zero for not being served) this problem is solved. Unfortunately, these single parameter optimal mechanisms are impractical and rarely employed, and furthermore the underlying economic theory fails to generalize to the important, relevant, and unsolved multi-dimensional setting (i.e., where each agents preference is given by multiple values for each of the multiple services available). In contrast to the theory of optimal mechanisms we develop a theory of sequential posted price mechanisms, where agents in sequence are offered take-it-or-leave-it prices. We prove that these mechanisms are approximately optimal in single-dimensional settings. These posted-price mechanisms avoid many of the properties of optimal mechanisms that make the latter impractical. Furthermore, these mechanisms generalize naturally to multidimensional settings where they give the first known approximations to the elusive optimal multi-dimensional mechanism design problem.
european symposium on algorithms | 2015
Hossein Efsandiari; MohammadTaghi Hajiaghyi; Jochen Könemann; Hamid Mahini; David L. Malec; Laura Sanità
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 feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra and Rinnoy Kan [Annals of Disc. Math., 1977] in their seminal work introduced this problem and showed that it is strongly NP-hard, even when all processing times and weights are 1. We study the approximability of the problem and our main result is an O(logk)-approximation algorithm for instances with k distinct job deadlines.
electronic commerce | 2010
Shuchi Chawla; David L. Malec; Balasubramanian Sivan
arXiv: Computer Science and Game Theory | 2010
Shuchi Chawla; Jason D. Hartline; David L. Malec; Balasubramanian Sivan
electronic commerce | 2011
Shuchi Chawla; David L. Malec; Azarakhsh Malekian
Games and Economic Behavior | 2015
Shuchi Chawla; David L. Malec; Balasubramanian Sivan
international world wide web conferences | 2014
Erik D. Demaine; Mohammad Taghi Hajiaghayi; Hamid Mahini; David L. Malec; S. Raghavan; Anshul Sawant; Morteza Zadimoghadam
international colloquium on automata languages and programming | 2012
Siddharth Barman; Seeun William Umboh; Shuchi Chawla; David L. Malec
arXiv: Computer Science and Game Theory | 2012
Zhiyi Huang; Nikhil R. Devanur; David L. Malec