Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Seddighin, Masoud
23  Ergebnisse:
Personensuche X
?
1

Improved maximin guarantees for subadditive and fractionall..:

Seddighin, Masoud ; Seddighin, Saeed
Artificial Intelligence.  327 (2024)  - p. 104049 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Approximating Longest Common Subsequence in Linear Time: Be..:

HajiAghayi, MohammadTaghi ; Seddighin, Masoud ; Seddighin, Saeedreza.
SIAM Journal on Computing.  51 (2022)  4 - p. 1341-1367 , 2022
Link: https://doi.org/10.1137/..
 
?
3

Fair allocation of indivisible goods: Beyond additive valua..:

Ghodsi, Mohammad ; HajiAghayi, MohammadTaghi ; Seddighin, Masoud..
Artificial Intelligence.  303 (2022)  - p. 103633 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Approximate Competitive Equilibrium with Generic Budget:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Ghiasi, Amin ; Seddighin, Masoud - p. 236-250 , 2021
Link: https://doi.org/10.1007/..
 
?
5

Improved algorithms for edit distance and LCS : beyond w..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Boroujeni, Mahdi ; Seddighin, Masoud ; Seddighin, Saeed - p. 1601-1620 , 2020
Link: https://dl.acm.org/doi/1..
 
?
6

Maximin share guarantee for goods with positive externaliti..:

Seddighin, Masoud ; Saleh, Hamed ; Ghodsi, Mohammad
Social Choice and Welfare.  56 (2020)  2 - p. 291-324 , 2020
Link: https://doi.org/10.1007/..
 
?
7

Externalities and Fairness:

, In: The World Wide Web Conference,
Seddighin, Masoud ; Saleh, Hamed ; Ghodsi, Mohammad - p. 538-548 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

Approximating LCS in linear time : beating the [MATH HER..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Hajiaghayi, MohammadTaghi ; Seddighin, Masoud ; Seddighin, Saeed. - p. 1181-1200 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

Fair Allocation of Indivisible Goods : Improvements and ..:

, In: Proceedings of the 2018 ACM Conference on Economics and Computation,
Ghodsi, Mohammad ; Hajiaghayi, Mohammadtaghi ; Seddighin, Masoud.. - p. 539-556 , 2018
Link: https://dl.acm.org/doi/1..
 
?
10

Rent Division Among Groups:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,
Ghodsi, Mohammad ; Latifian, Mohamad ; Mohammadi, Arman.. - p. 577-591 , 2018
Link: https://doi.org/10.1007/..
 
?
11

Expand the Shares Together: Envy-Free Mechanisms with a Sma..:

Seddighin, Masoud ; Farhadi, Majid ; Ghodsi, Mohammad..
Algorithmica.  81 (2018)  4 - p. 1728-1755 , 2018
Link: https://doi.org/10.1007/..
 
?
12

Fair Allocation of Indivisible Goods to Asymmetric Agents:

, In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems,
Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Ghodsi, Mohammad... - p. 1535-1537 , 2017
Link: https://dl.acm.org/doi/1..
 
?
13

Randomized and Deterministic Maximin-share Approximations f..:

Akrami, Hannaneh ; Mehlhorn, Kurt ; Seddighin, Masoud.
http://arxiv.org/abs/2308.14545.  , 2023
Link: http://arxiv.org/abs/230..
 
?
14

An EF2X Allocation Protocol for Restricted Additive Valuati..:

Akrami, Hannaneh ; Rezvan, Rojin ; Seddighin, Masoud
http://arxiv.org/abs/2202.13676.  , 2022
Link: http://arxiv.org/abs/220..
 
?
15

Rainbow Cycle Number and EFX Allocations: (Almost) Closing ..:

Jahan, Shayan Chashm ; Seddighin, Masoud ; Seyed-Javadi, Seyed-Mohammad.
http://arxiv.org/abs/2212.09482.  , 2022
Link: http://arxiv.org/abs/221..
 
1-15