Morteza Zadimoghaddam

Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. J. Scheduling 16(2): 151-160 (2013)

Erik D. Demaine, Morteza Zadimoghaddam: Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". SODA 2013: 1369-1379

Amin Karbasi, Morteza Zadimoghaddam: Constrained Binary Identification Problem. STACS 2013: 550-561

Erik D. Demaine, Morteza Zadimoghaddam: Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising. Internet Mathematics 8(1-2): 29-45 (2012)

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. ACM Transactions on Algorithms 8(2): 13 (2012)

Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam: Simultaneous approximations for adversarial and stochastic online budgeted allocation. SODA 2012: 1690-1701

Morteza Zadimoghaddam, Aaron Roth: Efficiently Learning from Revealed Preference. WINE 2012: 114-127

Morteza Zadimoghaddam, Aaron Roth: Efficiently Learning from Revealed Preference. CoRR abs/1211.4150 (2012)

Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam: Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60(4): 853-876 (2011)

Ali Kakhbod, Morteza Zadimoghaddam: On the construction of prefix-free and fix-free codes with specified codeword compositions. Discrete Applied Mathematics 159(18): 2269-2275 (2011)

Yoram Bachrach, Morteza Zadimoghaddam, Peter Key: A cooperative approach to collusion in auctions. SIGecom Exchanges 10(1): 17-22 (2011)

Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam: O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74

Amin Karbasi, Morteza Zadimoghaddam: Compression with graphical constraints: An interactive browser. ISIT 2011: 953-957

Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam: Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248

Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam: Online Stochastic Weighted Matching: Improved Approximation Algorithms. WINE 2011: 170-181

Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam: Optimal Coalition Structures in Graph Games. CoRR abs/1108.5248 (2011)

MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam: Submodular Secretary Problem and Extensions. APPROX-RANDOM 2010: 39-52

Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam: How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). ICALP (2) 2010: 115-126

Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum: Trading off Mistakes and Don't-Know Predictions. NIPS 2010: 2092-2100

Erik D. Demaine, Morteza Zadimoghaddam: Scheduling to minimize power consumption using submodular functions. SPAA 2010: 21-29

Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam: Collaborative scoring with dishonest participants. SPAA 2010: 41-49

Erik D. Demaine, Morteza Zadimoghaddam: Minimizing the Diameter of a Network Using Shortcut Edges. SWAT 2010: 420-431

Erik D. Demaine, Morteza Zadimoghaddam: Constant Price of Anarchy in Network Creation Games via Public Service Advertising. WAW 2010: 122-131

Yoram Bachrach, Peter Key, Morteza Zadimoghaddam: Collusion in VCG Path Procurement Auctions. WINE 2010: 38-49

Ali Kakhbod, Morteza Zadimoghaddam: On the Carter-Gill Conjecture. CoRR abs/1002.0097 (2010)

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in cooperative network creation games. SIGecom Exchanges 8(2): 2 (2009)

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. ACM Transactions on Algorithms 5(3) (2009)

Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. CoRR abs/0902.1400 (2009)

Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34

Ali Kakhbod, Ali Nazari, Morteza Zadimoghaddam: Some notes on fix-free codes. CISS 2008: 1015-1018

Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam: Permutation betting markets: singleton betting with extra information. ACM Conference on Electronic Commerce 2008: 180-189

Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Spanning trees with minimum weighted degrees. Inf. Process. Lett. 104(3): 113-116 (2007)

Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. PODC 2007: 292-298

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. SODA 2007: 258-267

Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54