( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Towards Characterizing the Deterministic Combinatorial Constrained Efficient Space.

, и . ADT, том 11834 из Lecture Notes in Computer Science, стр. 32-48. Springer, (2019)

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.

Rica Meinfelder

Gonen Eren

lmaz Gönen

Pascale Ricardoni

Attila Gönençcan

 

Другие публикации лиц с тем же именем

Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics, и . CoRR, (2002)Multi-sided Advertising Markets: Dynamic Mechanisms and Incremental User Compensations., , и . GameSec, том 11199 из Lecture Notes in Computer Science, стр. 227-247. Springer, (2018)Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants., и . SAGT, том 11059 из Lecture Notes in Computer Science, стр. 163-175. Springer, (2018)Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics., и . EC, стр. 13-20. ACM, (2000)Heuristics for Opinion Diffusion via Local Elections., , , и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 144-158. Springer, (2023)DYCOM: A Dynamic Truthful Budget Balanced Double-sided Combinatorial Market., и . AAMAS, стр. 1556-1558. ACM, (2017)On the Hardness of Truthful Online Auctions with Multidimensional Constraints.. CiE, том 5028 из Lecture Notes in Computer Science, стр. 221-230. Springer, (2008)Towards Characterizing the Deterministic Combinatorial Constrained Efficient Space., и . ADT, том 11834 из Lecture Notes in Computer Science, стр. 32-48. Springer, (2019)Negotiation-Range Mechanisms: Coalition-Resistant Markets.. ESA, том 3221 из Lecture Notes in Computer Science, стр. 383-394. Springer, (2004)Linear Programming helps solving large multi-unit combinatorial auctions, и . CoRR, (2002)