×

Found 93 Documents (Results 1–93)

Discrete versions of the KKM lemma and their PPAD-completeness. (English) Zbl 07615737

Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 170-189 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Computing envy-freeable allocations with limited subsidies. (English) Zbl 1533.91244

Feldman, Michal (ed.) et al., Web and internet economics. 17th international conference, WINE 2021, Potsdam, Germany, December 14–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13112, 522-539 (2022).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Two birds with one stone: fairness and welfare via transfers. (English) Zbl 1492.91161

Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 376-390 (2021).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI arXiv

When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores. (English) Zbl 1492.91156

Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 329-344 (2021).
MSC:  91B32 91A68
PDFBibTeX XMLCite
Full Text: DOI

Cake cutting: an envy-free and truthful mechanism with a small number of cuts. (English) Zbl 07765373

Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 15, 16 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Fair division. (English) Zbl 1455.91123

Sotomayor, Marilda (ed.) et al., Complex social and behavioral systems. Game theory and agent-based models. New York, NY: Springer. Encycl. Complex. Syst. Sci. Ser., 499-509 (2020).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. (English) Zbl 1498.68120

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 138, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Almost envy-free allocations with connected bundles. (English) Zbl 07559057

Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 14, 21 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Fair and efficient cake division with connected pieces. (English) Zbl 1435.91103

Caragiannis, Ioannis (ed.) et al., Web and Internet economics. 15th international conference, WINE 2019, New York, NY, USA, December 10–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11920, 57-70 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hardness results for consensus-halving. (English) Zbl 1498.68121

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 24, 16 p. (2018).
MSC:  68Q17 91B32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Rent division among groups. (English) Zbl 1522.91139

Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11346, 577-591 (2018).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI

An improved envy-free cake cutting protocol for four agents. (English) Zbl 1415.91170

Deng, Xiaotie (ed.), Algorithmic game theory. 11th international symposium, SAGT 2018, Beijing, China, September 11–14, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11059, 87-99 (2018).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Sperner’s colorings and optimal partitioning of the simplex. (English) Zbl 1384.05188

Loebl, Martin (ed.) et al., A journey through discrete mathematics. A tribute to Jiří Matoušek. Cham: Springer (ISBN 978-3-319-44478-9/hbk; 978-3-319-44479-6/ebook). 615-631 (2017).
MSC:  05E45 05C65
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fairly allocating contiguous blocks of indivisible items. (English) Zbl 1403.91216

Bilò, Vittorio (ed.) et al., Algorithmic game theory. 10th international symposium, SAGT 2017, L’Aquila, Italy, September 12–14, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-66699-0/pbk; 978-3-319-66700-3/ebook). Lecture Notes in Computer Science 10504, 333-344 (2017).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Proving Tucker’s lemma with a volume argument. (English) Zbl 1360.05020

Harrington, Heather A. (ed.) et al., Algebraic and geometric methods in discrete mathematics. AMS special session on algebraic and geometric methods in applied discrete mathematics, San Antonio, TX, USA, January 11, 2015. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2321-6/pbk; 978-1-4704-3743-5/ebook). Contemporary Mathematics 685, 223-230 (2017).
MSC:  05A99 51D20 55M20
PDFBibTeX XMLCite
Full Text: DOI arXiv

A discrete and bounded envy-free cake cutting protocol for four agents. (English) Zbl 1373.68251

Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 454-464 (2016).
MSC:  68Q25 68T42 91B32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Envy-free division of discrete cakes. (English) Zbl 1268.91089

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 231-236 (2011).
MSC:  91B32
PDFBibTeX XMLCite
Full Text: DOI

Cutting a cake for five people. (English) Zbl 1246.91006

Goldberg, Andrew V. (ed.) et al., Algorithmic aspects in information and management. 5th international conference, AAIM 2009, San Francisco, CA, USA, June 15–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02157-2/pbk). Lecture Notes in Computer Science 5564, 292-300 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field