Cake Cutting Algorithms

Author : Jack Robertson,William Webb
Publisher : CRC Press
Page : 177 pages
File Size : 55,7 Mb
Release : 1998-07-15
Category : Mathematics
ISBN : 9781439863855

Get Book

Cake-Cutting Algorithms by Jack Robertson,William Webb Pdf

The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms for the fair division problem in the 1940s, the concept has been widely popularized. This book

Author : Jack Robertson,William Webb
Publisher : A K Peters/CRC Press
Page : 177 pages
File Size : 42,9 Mb
Release : 1998-07-15
Category : Mathematics
ISBN : 1568810768

Get Book

Cake-Cutting Algorithms by Jack Robertson,William Webb Pdf

The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms for the fair division problem in the 1940s, the concept has been widely popularized. This book gathers into one readable and inclusive source a comprehensive discussion of the state of the art in cake-cutting problems for both the novice and the professional. It offers a complete treatment of all cake-cutting algorithms under all the considered definitions of "fair" and presents them in a coherent, reader-friendly manner. Robertson and Webb have brought this elegant problem to life for both the bright high school student and the professional researcher.

Author : Steven J. Brams,Alan D. Taylor
Publisher : Cambridge University Press
Page : 292 pages
File Size : 54,7 Mb
Release : 1996-02-23
Category : Business & Economics
ISBN : 0521556449

Get Book

Fair Division by Steven J. Brams,Alan D. Taylor Pdf

Cutting a cake, dividing up the property in an estate, determining the borders in an international dispute - such problems of fair division are ubiquitous. Fair Division treats all these problems and many more through a rigorous analysis of a variety of procedures for allocating goods (or 'bads' like chores), or deciding who wins on what issues, when there are disputes. Starting with an analysis of the well-known cake-cutting procedure, 'I cut, you choose', the authors show how it has been adapted in a number of fields and then analyze fair-division procedures applicable to situations in which there are more than two parties, or there is more than one good to be divided. In particular they focus on procedures which provide 'envy-free' allocations, in which everybody thinks he or she has received the largest portion and hence does not envy anybody else. They also discuss the fairness of different auction and election procedures.

Author : Robertson&webb
Publisher : Universities Press
Page : 196 pages
File Size : 46,5 Mb
Release : 2024-06-27
Category : Electronic
ISBN : 8173714487

Get Book

Cake-Cutting Algorithms-Be Fair If You Can by Robertson&webb Pdf

Author : Felix Brandt,Vincent Conitzer,Ulle Endriss,Jérôme Lang,Ariel D. Procaccia
Publisher : Cambridge University Press
Page : 553 pages
File Size : 52,6 Mb
Release : 2016-04-25
Category : Business & Economics
ISBN : 9781107060432

Get Book

Handbook of Computational Social Choice by Felix Brandt,Vincent Conitzer,Ulle Endriss,Jérôme Lang,Ariel D. Procaccia Pdf

A comprehensive survey of computational aspects of collective decisions for graduate students, researchers, and professionals in computer science and economics.

Author : Jörg Rothe
Publisher : Springer
Page : 612 pages
File Size : 52,6 Mb
Release : 2015-08-18
Category : Business & Economics
ISBN : 9783662479049

Get Book

Economics and Computation by Jörg Rothe Pdf

This textbook connects three vibrant areas at the interface between economics and computer science: algorithmic game theory, computational social choice, and fair division. It thus offers an interdisciplinary treatment of collective decision making from an economic and computational perspective. Part I introduces to algorithmic game theory, focusing on both noncooperative and cooperative game theory. Part II introduces to computational social choice, focusing on both preference aggregation (voting) and judgment aggregation. Part III introduces to fair division, focusing on the division of both a single divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In all these parts, much weight is given to the algorithmic and complexity-theoretic aspects of problems arising in these areas, and the interconnections between the three parts are of central interest.

Author : Jennifer Segal
Publisher : Clarkson Potter
Page : 289 pages
File Size : 51,9 Mb
Release : 2021-09-14
Category : Cooking
ISBN : 9780593231838

Get Book

Once Upon a Chef: Weeknight/Weekend by Jennifer Segal Pdf

NEW YORK TIMES BESTSELLER • 70 quick-fix weeknight dinners and 30 luscious weekend recipes that make every day taste extra special, no matter how much ​time you have to spend in the kitchen—from the beloved bestselling author of Once Upon a Chef. “Jennifer’s recipes are healthy, approachable, and creative. I literally want to make everything from this cookbook!”—Gina Homolka, author of The Skinnytaste Cookbook Jennifer Segal, author of the blog and bestselling cookbook Once Upon a Chef, is known for her foolproof, updated spins on everyday classics. Meticulously tested and crafted with an eye toward both flavor and practicality, Jenn’s recipes hone in on exactly what you feel like making. Here she devotes whole chapters to fan favorites, from Marvelous Meatballs to Chicken Winners, and Breakfast for Dinner to Family Feasts. Whether you decide on sticky-sweet Barbecued Soy and Ginger Chicken Thighs; an enlightened and healthy-ish take on Turkey, Spinach & Cheese Meatballs; Chorizo-Style Burgers; or Brownie Pudding that comes together in under thirty minutes, Jenn has you covered.

Author : Xiaotie Deng
Publisher : Springer
Page : 292 pages
File Size : 50,9 Mb
Release : 2018-08-26
Category : Computers
ISBN : 9783319996608

Get Book

Algorithmic Game Theory by Xiaotie Deng Pdf

This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018. The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications.

Author : Amin Saberi
Publisher : Springer
Page : 580 pages
File Size : 54,8 Mb
Release : 2010-12-06
Category : Computers
ISBN : 9783642175725

Get Book

Internet and Network Economics by Amin Saberi Pdf

This book constitutes the refereed proceedings of the 6th International Workshop on Internet and Network Economics, WINE 2010, held in Stanford, USA, in December 2010. The 52 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers are organized in 33 regular papers and 19 short papers.

Author : Jeff Edmonds
Publisher : Cambridge University Press
Page : 409 pages
File Size : 47,9 Mb
Release : 2008-05-19
Category : Computers
ISBN : 9781139471756

Get Book

How to Think About Algorithms by Jeff Edmonds Pdf

This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.

Author : H. Steinhaus
Publisher : Courier Corporation
Page : 336 pages
File Size : 40,8 Mb
Release : 2012-07-12
Category : Mathematics
ISBN : 9780486166483

Get Book

Mathematical Snapshots by H. Steinhaus Pdf

Numerous photographs and diagrams explain mathematical phenomena in series of thought-provoking expositions. From simple puzzles to more advanced problems, topics include psychology of lottery players, new and larger prime numbers, and more. 391 illustrations.

Author : Francesca Rossi
Publisher : Springer Science & Business Media
Page : 471 pages
File Size : 54,5 Mb
Release : 2009-10-05
Category : Business & Economics
ISBN : 9783642044274

Get Book

Algorithmic Decision Theory by Francesca Rossi Pdf

This volume contains the papers presented at ADT 2009, the first International Conference on Algorithmic Decision Theory. The conference was held in San Servolo, a small island of the Venice lagoon, during October 20-23, 2009. The program of the conference included oral presentations, posters, invited talks, and tutorials. The conference received 65 submissions of which 39 papers were accepted (9 papers were posters). The topics of these papers range from computational social choice preference modeling, from uncertainty to preference learning, from multi-criteria decision making to game theory.

Author : Helmut Alt,Michel Habib
Publisher : Springer
Page : 706 pages
File Size : 40,5 Mb
Release : 2003-07-01
Category : Computers
ISBN : 9783540364948

Get Book

STACS 2003 by Helmut Alt,Michel Habib Pdf

This book constitutes the refereed proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2003, held in Berlin, Germany in February/March 2003. The 58 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 253 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.

Author : R. Balakrishnan,Sriraman Sridharan
Publisher : CRC Press
Page : 361 pages
File Size : 47,6 Mb
Release : 2018-10-26
Category : Mathematics
ISBN : 9781351019125

Get Book

Foundations of Discrete Mathematics with Algorithms and Programming by R. Balakrishnan,Sriraman Sridharan Pdf

Discrete Mathematics has permeated the whole of mathematics so much so it has now come to be taught even at the high school level. This book presents the basics of Discrete Mathematics and its applications to day-to-day problems in several areas. This book is intended for undergraduate students of Computer Science, Mathematics and Engineering. A number of examples have been given to enhance the understanding of concepts. The programming languages used are Pascal and C.

Author : Rudolf Fleischer,Jinhui Xu
Publisher : Springer
Page : 352 pages
File Size : 44,9 Mb
Release : 2008-06-17
Category : Computers
ISBN : 9783540688808

Get Book

Algorithmic Aspects in Information and Management by Rudolf Fleischer,Jinhui Xu Pdf

This book constitutes the refereed proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, held in Shanghai, China, in June 2008. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science. Topics addressed are: approximation algorithms, geometric data management, biological data management, graph algorithms, computational finance, mechanism design, computational game theory, network optimization, data structures, operations research, discrete optimization, online algorithms, FPT algorithms, and scheduling algorithms.