( en | de | ru )

 

Disambiguation of "Telelis, Orestis"

Author of the publication

copydeleteadd this publication to your clipboard
Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods.

, , and . J. Artif. Intell. Res., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Orestis Terzidis

Orestis Hadjianghelou

Orestis Gkorgkas

Orestis Lyros

Orestis Vantzos

 

Other publications of authors with the same name

Absolute o(log m) error in approximating random set covering: an average case analysis., and . Inf. Process. Lett., 94 (4): 171-177 (2005)Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions., , and . IJCAI, page 4275-4281. AAAI Press, (2015)Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets., and . SAGT, volume 9928 of Lecture Notes in Computer Science, page 247-259. Springer, (2016)Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι. National and Kapodistrian University of Athens, Greece, (2006)National Archive of PhD Theses: oai:10442/22196.Mechanisms for multi-unit combinatorial auctions with a few distinct goods., , and . AAMAS, page 691-698. IFAAMAS, (2013)On the Inefficiency of the Uniform Price Auction, and . CoRR, (2012)Combinatorial Optimization through Statistical Instance-Based Learning., and . ICTAI, page 203-209. IEEE Computer Society, (2001)Item Pricing for Combinatorial Public Projects., and . AAIM, volume 9778 of Lecture Notes in Computer Science, page 1-13. Springer, (2016)Selfish Scheduling with Setup Times., , and . WINE, volume 5929 of Lecture Notes in Computer Science, page 292-303. Springer, (2009)Uniform Price Auctions: Equilibria and Efficiency., and . SAGT, volume 7615 of Lecture Notes in Computer Science, page 227-238. Springer, (2012)