Author of the publication

The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is).

, , and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 109-122. 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

One Dollar Each Eliminates Envy., , , , and . CoRR, (2019)Fair Division via Quantile Shares., , , and . CoRR, (2023)Risk-Free Bidding in Complement-Free Combinatorial Auctions., , and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 123-136. Springer, (2019)The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is)., , and . SAGT, volume 11801 of Lecture Notes in Computer Science, page 109-122. Springer, (2019)Risk-Free Bidding in Complement-Free Combinatorial Auctions., , and . CoRR, (2021)The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)., , and . Theory Comput. Syst., 66 (3): 546-580 (2022)Risk-Free Bidding in Complement-Free Combinatorial Auctions., , and . Theory Comput. Syst., 66 (3): 581-615 (2022)The Speed and Threshold of the Biased Hamilton Cycle Game., , , , , and . LAGOS, volume 195 of Procedia Computer Science, page 200-211. Elsevier, (2021)A 17/12-approximation algorithm for 2-vertex-connected spanning subgraphs on graphs with minimum degree at least 3.. CoRR, (2016)Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations., , , and . CoRR, (2023)